Monochromatic spanning trees and matchings in ordered complete graphs

DOI10.1002/jgt.23058arXiv2210.10135MaRDI QIDQ6199379

András Gyárfás, Géza Tóth, János Barát

Publication date: 23 February 2024

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

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

zbMATH Keywords

matchingspanning treeordered graphcrossing edgesmonochromatictwisted drawinggeometric Ramseynested edges

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• Edge-critical subgraphs of Schrijver graphs
• Ramsey-type results for geometric graphs. I
• Large Monochromatic Components in Edge Colorings of Graphs: A Survey
• The Chromatic Number of Kneser Hypergraphs
• The Ramsey number for stripes
• Graph Classes: A Survey
• Extremal theory of vertex or edge ordered graphs
• Ordered Ramsey numbers
• Ramsey numbers of ordered graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Monochromatic spanning trees and matchings in ordered complete graphs