Graphs omitting a finite set of cycles

DOI<351::AID-JGT11>3.0.CO;2-K 10.1002/(SICI)1097-0118(199603)21:3<351::AID-JGT11>3.0.CO;2-KzbMath0845.05060OpenAlexW2037390311MaRDI QIDQ4875691

Niandong Shi, Gregory L. Cherlin

Publication date: 26 August 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199603)21:3<351::aid-jgt11>3.0.co;2-k

zbMATH Keywords

cyclesembeddingsuniversal countable graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Stable generic structures, Universal graphs with a forbidden subtree, Nonexistence of universal graphs without some trees, A note on classes of subgraphs of locally finite graphs, Bowtie‐free graphs and generic automorphisms, Many Facets of Dualities, Forbidden subgraphs and forbidden substructures, Some remarks on universal graphs, Forbidden substructures and combinatorial dichotomies: WQO and universality, All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms), Universal graphs with forbidden subgraphs and algebraic closure