Ramsey numbers of trails and circuits

DOI10.1002/JGT.22865zbMath1522.05291arXiv2109.02633OpenAlexW3198511689WikidataQ114236120 ScholiaQ114236120MaRDI QIDQ6093145

Mykhaylo Tyomkyn, David Conlon

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.02633

zbMATH Keywords

Ramsey theoryEulerian graphsmonochromatic components

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Large monochromatic components in colorings of complete hypergraphs ⋮ On Connected Components with Many Edges

Cites Work

• On the minimal length of the longest trail in a fixed edge-density graph
• Large Monochromatic Components in Edge Colorings of Graphs: A Survey

This page was built for publication: Ramsey numbers of trails and circuits