mathematical field of graph theory, the Folkman graph is a 4-regular graph with 20 vertices and 40 edges. It is a regular bipartite graph with symmetries taking...

study semi-symmetric graphs, and he discovered the semi-symmetric graph with the fewest possible vertices, now known as the Folkman graph. He proved the existence...

American medical scientist Roy Folkman, an Israeli politician Folkman graph, a type of semi-symmetric graph in graph theory Folkman's theorem, a theorem in arithmetic...

was seen by Jon Folkman, whose paper, published in 1967, includes the smallest semi-symmetric graph, now known as the Folkman graph, on 20 vertices....

regular graph which is edge-transitive but not vertex-transitive. The Folkman graph, a quartic graph on 20 vertices is the smallest such graph. The vertex...

Coxeter graph Tutte–Coxeter graph Dyck graph Klein graph Foster graph Biggs–Smith graph The Rado graph Folkman graph Gray graph Ljubljana graph Tutte 12-cage...

In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving...

Few graphs show semi-symmetry: most edge-transitive graphs are also vertex-transitive. The smallest semi-symmetric graph is the Folkman graph, with...

The Shapley–Folkman lemma is a result in convex geometry that describes the Minkowski addition of sets in a vector space. It is named after mathematicians...

quartic graph with 12 vertices, the smallest quartic graph that both has no triangles and cannot be colored with three colors. The Folkman graph, a quartic...