Discrepancies of spanning trees and Hamilton cycles
DOI10.1016/j.jctb.2022.01.003zbMath1483.05088arXiv2012.05155OpenAlexW4210437451MaRDI QIDQ2668020
Michael Krivelevich, Lior Gishboliner, Peleg Michaeli
Publication date: 3 March 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.05155
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Compressions and isoperimetric inequalities
- The isoperimetric number of random regular graphs
- Matchings and covers in hypergraphs
- Cycle lengths in expanding graphs
- On the discrepancies of graphs
- Ramsey numbers of path-matchings, covering designs, and 1-cores
- Introduction to Random Graphs
- Large Monochromatic Components in Edge Colorings of Graphs: A Survey
- Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs
- Extremal Finite Set Theory
- Expander graphs and their applications
- Discrete Isoperimetric Problems
- Multicolour Discrepancies
- A Note on Color-Bias Hamilton Cycles in Dense Graphs
- A discrepancy version of the Hajnal–Szemerédi theorem
- Optimal numberings and isoperimetric problems on graphs
- Imbalances in k‐colorations
- Geometric discrepancy. An illustrated guide
This page was built for publication: Discrepancies of spanning trees and Hamilton cycles
