Infinite graphs that do not contain cycles of length four
Abstract
We construct a countable infinite graph G that does not contain cycles of length four having the property that the sequence of graphs Gn induced by the first n vertices has minimum degree δ(Gn)> n2-1+o(1).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.