Graph Tilings in Incompatibility Systems
From MaRDI portal
Publication:6046822
DOI10.1137/22m1506353zbMath1521.05159arXiv2207.05386OpenAlexW4386255082MaRDI QIDQ6046822
Hao Li, Donglei Yang, Unnamed Author, Jie Hu
Publication date: 6 September 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.05386
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time perfect matchings in dense hypergraphs
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
- Increasing the chromatic number of a random graph
- Compatible Hamilton cycles in Dirac graphs
- Lopsided Lovász Local lemma and Latin transversals
- Rainbow \(H\)-factors
- On the resilience of long cycles in random graphs
- Biased positional games and small hypergraphs with large covers
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Alternating Hamiltonian cycles
- A property of the colored complete graph
- Blow-up lemma
- Tiling Turán theorems
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- Graphs with Hamiltonian cycles having adjacent lines different colours
- \(H\)-factors in dense graphs
- The minimum degree threshold for perfect graph packings
- A degree sequence version of the Kühn-Osthus tiling theorem
- Embedding rainbow trees with applications to graph labelling and decomposition
- Rainbow factors in hypergraphs
- Spanning trees in random graphs
- \(F\)-factors in hypergraphs via absorption
- Perfect packings with complete graphs minus an edge
- Compatible Hamilton cycles in random graphs
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
- Local resilience of almost spanning trees in random graphs
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- Resilient Pancyclicity of Random and Pseudorandom Graphs
- On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
- An Ore-type Theorem for Perfect Packings in Graphs
- Local resilience of graphs
- Biased Positional Games
- Proof of a tiling conjecture of Komlós
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- K4−‐factor in a graph
- On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem
- A rainbow blow‐up lemma
- Rainbow structures in locally bounded colorings of graphs
- A Rainbow Dirac's Theorem
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Robustness of graph properties
- Rainbow matchings in Dirac bipartite graphs
- Robust Hamiltonicity of Dirac graphs
- Some Theorems on Abstract Graphs
- Proof of the Alon-Yuster conjecture
- Embedding clique-factors in graphs with low \(\ell\)-independence number
- Factors in randomly perturbed hypergraphs
This page was built for publication: Graph Tilings in Incompatibility Systems
