Spanning trees in graphs without large bipartite holes
From MaRDI portal
Publication:6632805
DOI10.1017/S0963548323000378MaRDI QIDQ6632805
Jie Han, Donglei Yang, Guanghui Wang, Lidan Ping, Jie Hu, Yi Wang
Publication date: 5 November 2024
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quadripartite version of the Hajnal-Szemerédi theorem
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Expanding graphs contain all small trees
- Tripartite version of the Corrádi-Hajnal theorem
- Triangle-factors in a balanced blown-up triangle
- \(K_r\)-factors in graphs with low independence number
- Tight bounds for powers of Hamilton cycles in tournaments
- Spanning trees in random graphs
- A multipartite Hajnal-Szemerédi theorem
- Tree embeddings
- Spanning trees in dense graphs
- Triangle factors of graphs without large independent sets and of weighted graphs
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
- Embedding Spanning Trees in Random Graphs
- A proof of Alon’s second eigenvalue conjecture and related problems
- The Blow-up Lemma
- Variants of the Hajnal-Szemer�di Theorem
- Hamilton Cycles, Minimum Degree, and Bipartite Holes
- How many random edges make a dense graph hamiltonian?
- Proof of a Packing Conjecture of Bollobás
- A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
- Expanders Are Universal for the Class of All Spanning Trees
- On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem
- Tree decompositions of graphs without large bipartite holes
- Universality for bounded degree spanning trees in randomly perturbed graphs
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
- Transversal Ck-factors in subgraphs of the balanced blow-up of Ck
- Embedding clique-factors in graphs with low \(\ell\)-independence number
- Clique-factors in graphs with sublinear -independence number
This page was built for publication: Spanning trees in graphs without large bipartite holes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632805)
