Readfeed

Jon H. Folkman

1938 – 1969

American mathematician, a student of John Milnor, and a researcher at the RAND Corporation.

  • Regular line symmetric graphsRegular line symmetric graphs
  • A limit theorem for subadditive collections of sequencesA limit theorem for subadditive collections of sequences
  • An upper bound on the chromatic number of a graphAn upper bound on the chromatic number of a graph
  • Approximating one convex function by anotherApproximating one convex function by another
  • Edge colorings in bipartite graphsEdge colorings in bipartite graphs
  • Equivariant maps of spheres into the classical groupsEquivariant maps of spheres into the classical groups
  • Graphs with monochromatic complete subgraphs in every edge coloringGraphs with monochromatic complete subgraphs in every edge coloring
  • On Markov chains with the strong ratio limit propertyOn Markov chains with the strong ratio limit property
  • On stabilizing matrices by simple row operationsOn stabilizing matrices by simple row operations
  • On the representation of integers as sums of distinct terms from a fixed sequenceOn the representation of integers as sums of distinct terms from a fixed sequence
  • Optimal procedures for stochastically failing equipmentOptimal procedures for stochastically failing equipment
  • Subgraphs of bipartite and directed graphsSubgraphs of bipartite and directed graphs