Noncrossing monochromatic subtrees and staircases in 0-1 matrices

DOI10.1155/2014/731519zbMath1295.05149OpenAlexW2098446621WikidataQ59051258 ScholiaQ59051258MaRDI QIDQ2249949

Warren Shull, Siyuan Cai, Gillian Roxanne Grindstaff, András Gyárfás

Publication date: 4 July 2014

Published in: Journal of Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/731519

zbMATH Keywords

monochromatic noncrossing subtree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

On the staircases of Gyárfás

Cites Work

• Ramsey-type results for geometric graphs. II
• Drawing graphs in two layers
• Disjoint edges in geometric graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Noncrossing monochromatic subtrees and staircases in 0-1 matrices