F$F$‐factors in Quasi‐random Hypergraphs
From MaRDI portal
Publication:6134524
DOI10.1112/jlms.12611zbMath1525.05136arXiv2108.10731OpenAlexW4225275434MaRDI QIDQ6134524
Wenling Zhou, Lai-hao Ding, Shumin Sun, Jie Han, Guang-Hui Wang
Publication date: 22 August 2023
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.10731
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30)
Related Items (2)
Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Clique-factors in graphs with sublinear -independence number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A problem of Erdős and Sós on 3-graphs
- Perfect packings in quasirandom hypergraphs. I.
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
- A new upper bound for diagonal Ramsey numbers
- Weak hypergraph regularity and linear hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- Blow-up lemma
- Hypergraphs, quasi-randomness, and conditions for regularity
- On a Turán problem in weakly quasirandom 3-uniform hypergraphs
- On Ramsey - Turan type theorems for hypergraphs
- Extremal problems in uniformly dense hypergraphs
- The complexity of perfect matchings and packings in dense hypergraphs
- \(F\)-factors in hypergraphs via absorption
- The average number of spanning trees in sparse graphs with given degrees
- On extremal problems of graphs and generalized graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- σ-algebras for quasirandom hypergraphs
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- Weak quasi-randomness for uniform hypergraphs
- Quasi-random hypergraphs revisited
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Quasi-random hypergraphs
- Factors in random graphs
- An upper bound for some ramsey numbers
- Quasi‐random classes of hypergraphs
- Regularity lemmas for hypergraphs and quasi-randomness
- Paul turán, 1910–1976: His work in graph theory
- Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
- On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
- Some Remarks on π
- Regularity Lemma for k-uniform hypergraphs
- Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs
- Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
- Finding Perfect Matchings in Dense Hypergraphs
- The poset of hypergraph quasirandomness
- Perfect Packings in Quasirandom Hypergraphs II
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
- A geometric theory for hypergraph matching
- On the maximal number of independent circuits in a graph
- On the structure of linear graphs
- Quasi-random graphs
- Quasirandomness in hypergraphs
- Diagonal Ramsey via effective quasirandomness
This page was built for publication: F$F$‐factors in Quasi‐random Hypergraphs
