Tight Hamilton cycles with high discrepancy
From MaRDI portal
Cites work
- A discrepancy version of the Hajnal-Szemerédi theorem
- A note on color-bias Hamilton cycles in dense graphs
- A note on color-bias perfect matchings in hypergraphs
- An approximate Dirac-type theorem for k-uniform hypergraphs
- An oriented discrepancy version of Dirac's theorem
- Asymptotic behavior of the chromatic index for hypergraphs
- Color‐biased Hamilton cycles in random graphs
- Concentration of Measure for the Analysis of Randomized Algorithms
- Counting Hamilton cycles in Dirac hypergraphs
- Discrepancies of spanning trees and Hamilton cycles
- Hamiltonian chains in hypergraphs
- scientific article; zbMATH DE number 881162 (Why is no real title available?)
- Kneser's conjecture, chromatic number, and homotopy
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Loose Hamilton cycles in hypergraphs
- Matchings in hypergraphs of large minimum degree
- Minimum degree threshold for \(H\)-factors with high discrepancy
- Near perfect coverings in graphs and hypergraphs
- On extremal problems of graphs and generalized graphs
- On the discrepancies of graphs
- Oriented discrepancy of Hamilton cycles
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Powers of Hamilton cycles of high discrepancy are unavoidable
- Pseudorandom hypergraph matchings
- The Chromatic Number of Kneser Hypergraphs
- The probabilistic method
Cited in
(2)
This page was built for publication: Tight Hamilton cycles with high discrepancy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879469)
