A Ramsey-type theorem for traceable graphs

DOI10.1016/0095-8956(82)90053-3zbMath0477.05048OpenAlexW2063766677MaRDI QIDQ1160143

Fred Galvin, Bill Sands, Ivan Rival

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90053-3

zbMATH Keywords

Hamiltonian pathfinitely generated infinite lattice of length three

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Eulerian and Hamiltonian graphs (05C45) Lattices (06B99)

Related Items (11)

Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths ⋮ Radius two trees specify χ‐bounded classes ⋮ Radius two trees specify χ‐bounded classes ⋮ Unavoidable Induced Subgraphs of Large 2-Connected Graphs ⋮ Long induced paths in minor-closed graph classes and beyond ⋮ Sparse graphs without long induced paths ⋮ The ubiquitous Petersen graph ⋮ Where First-Order and Monadic Second-Order Logic Coincide ⋮ Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs ⋮ Obituary: Ivan Rival ⋮ Reverse mathematics and infinite traceable graphs

This page was built for publication: A Ramsey-type theorem for traceable graphs