Powers of Hamilton Cycles of High Discrepancy are Unavoidable
Powers of Hamilton Cycles of High Discrepancy are Unavoidable
The PoĢsa-Seymour conjecture asserts that every graph on n vertices with minimum degree at least (1ā1/(r +1))n contains the r-th power of a Hamilton cycle. KomloĢs, SaĢrkoĢzy and SzemereĢdi famously proved the conjecture for large n. The notion of discrepancy appears in many areas of mathematics, including graph theory. In ā¦