Indexed metadata
Generalized short monochromatic odd cycles
Sammy Luo, Zixuan Xu
Source abstract
Answering a question of Noga Alon, we generalize a result of Janzer and Yip to show that every -edge-coloring of contains a monochromatic subgraph with chromatic number at least and diameter .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.