8 problems
For every countable connected graph such that every nonidentity automorphism moves infinitely many edges, and for every assignment of a two-element list of available col…
Does ZFC prove that there exists a simple graph such that , , and , where…
For every positive integer , every finite connected graph , and every subset such that for every with…
Unfriendly partition conjecture. Every countable graph admits an unfriendly bipartition.
Countability-free vertex-flame conjecture. We may omit the countability of in Theorem.
Let be a digraph, let be an infinite cardinal, and let for be edge-disjoint branchings in . Define … Suppose that…
Let be a locally finite graph, and let denote its line graph. A Hamiltonian circle is a circle in the Freudenthal compactification of that contains every vertex o…
Bruhn's conjecture. Every -connected locally finite planar graph has a Hamilton circle.