A Ramsey-type theorem for traceable graphs

DOI10.1016/0095-8956(82)90053-3MaRDI QIDQ1160143zbMATH OpenOpenAlexFDO

Authors Ivan Rival, Bill Sands, Fred Galvin

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

finitely generated infinite lattice of length threeHamiltonian path

Mathematics Subject Classification ID

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

Cited in

(17)

• The ubiquitous Petersen graph
• Obituary: Ivan Rival
• Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths
• Long induced paths in minor-closed graph classes and beyond
• Reverse mathematics and infinite traceable graphs
• Radius two trees specify χ‐bounded classes
• Radius two trees specify χ‐bounded classes
• Obstructions for three-coloring and list three-coloring H-free graphs
• Where first-order and monadic second-order logic coincide
• Unavoidable Induced Subgraphs of Large 2-Connected Graphs
• Sparse graphs without long induced paths
• Long induced paths and forbidden patterns: polylogarithmic bounds
• Graph theory. Abstracts from the workshop held January 5--10, 2025
• Long induced paths in \(K_{s, s}\)-free graphs
• Bounding width on graph classes of constant diameter
• Ramsey-type results on parameters related to domination
• Treedepth and 2-treedepth in graphs with no long induced paths

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1160143)