Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs
From MaRDI portal
Publication:2072184
DOI10.1016/j.jctb.2021.12.002OpenAlexW4200459497MaRDI QIDQ2072184
Publication date: 26 January 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.00165
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Problems and results in extremal combinatorics. III.
- Counting and packing Hamilton cycles in dense graphs and oriented graphs
- A survey on Hamilton cycles in directed graphs
- Hamiltonian cycles in Dirac graphs
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Proof of the van der Waerden conjecture for permanents
- On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs
- The number of Hamiltonian decompositions of regular graphs
- The maximum number of Hamiltonian paths in tournaments
- Sequences with adjacent elements unequal
- On the maximum number of Hamiltonian paths in tournaments
- Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
- Extremal problems on set systems
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- Law of the iterated logarithm for random graphs
- Hamiltonian Cycles in Regular Tournaments
- On t-Designs and Groups
- On the Maximum Number of Spanning Copies of an Orientation in a Tournament
- On the Number of Hamiltonian Cycles in a Tournament
- Quasi-random graphs
This page was built for publication: Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs
