Pages that link to "Item:Q3656239"
From MaRDI portal
The following pages link to Embedding large subgraphs into dense graphs (Q3656239):
Displayed 50 items.
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← links)
- A degree sequence Hajnal-Szemerédi theorem (Q256981) (← links)
- Local resilience of spanning subgraphs in sparse random graphs (Q322312) (← links)
- Monochromatic cycle partitions of graphs with large minimum degree (Q345114) (← links)
- The extremal function for partial bipartite tilings (Q412273) (← links)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641) (← links)
- Hamilton cycles in dense vertex-transitive graphs (Q462925) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
- Forbidding Hamilton cycles in uniform hypergraphs (Q530769) (← links)
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
- An approximate version of Sumner's universal tournament conjecture (Q651033) (← links)
- Bandwidth theorem for random graphs (Q765187) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q895997) (← links)
- A note on perfect matchings in uniform hypergraphs (Q907268) (← links)
- Cycles of given length in oriented graphs (Q965252) (← links)
- Hamiltonian degree sequences in digraphs (Q974465) (← links)
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs (Q1633862) (← links)
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs (Q1671670) (← links)
- \(d\)-matching in 3-uniform hypergraphs (Q1690241) (← links)
- Tiling tripartite graphs with 3-colorable graphs: the extreme case (Q1756047) (← links)
- On multipartite Hajnal-Szemerédi theorems (Q1945958) (← links)
- Matching in 3-uniform hypergraphs (Q1999738) (← links)
- Spanning trees of dense directed graphs (Q2132400) (← links)
- Long monochromatic paths and cycles in 2-colored bipartite graphs (Q2185910) (← links)
- Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles (Q2195224) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Rainbow factors in hypergraphs (Q2299634) (← links)
- Degree versions of theorems on intersecting families via stability (Q2326331) (← links)
- \(F\)-factors in hypergraphs via absorption (Q2345534) (← links)
- A multipartite Hajnal-Szemerédi theorem (Q2349514) (← links)
- Hamilton decompositions of regular expanders: applications (Q2434714) (← links)
- Fractional and integer matchings in uniform hypergraphs (Q2637239) (← links)
- Triangle resilience of the square of a Hamilton cycle in random graphs (Q2664554) (← links)
- On factors of independent transversals in \(k\)-partite graphs (Q2665964) (← links)
- Spanning trees in dense directed graphs (Q2673485) (← links)
- Spanning embeddings of arrangeable graphs with sublinear bandwidth (Q2795744) (← links)
- (Q2857428) (← links)
- (Q2857450) (← links)
- Permanents of multidimensional matrices: Properties and applications (Q2959191) (← links)
- A hypergraph blow-up lemma (Q3094607) (← links)
- TILING DIRECTED GRAPHS WITH TOURNAMENTS (Q3119461) (← links)
- Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture (Q3178439) (← links)
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II (Q3185658) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A blow-up lemma for approximate decompositions (Q4633567) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Matching of Given Sizes in Hypergraphs (Q5043636) (← links)