Pages that link to "Item:Q949794"
From MaRDI portal
The following pages link to An approximate Dirac-type theorem for \(k\)-uniform hypergraphs (Q949794):
Displaying 36 items.
- Linear trees in uniform hypergraphs (Q2509754) (← links)
- Euler tours in hypergraphs (Q2658380) (← links)
- Spanning trees in dense directed graphs (Q2673485) (← links)
- Properly colored Hamilton cycles in Dirac-type hypergraphs (Q2692184) (← links)
- Hamilton cycles in quasirandom hypergraphs (Q2820275) (← links)
- Hypergraph Extensions of the Erdős-Gallai Theorem (Q2883632) (← links)
- Packing hamilton cycles in random and pseudo-random hypergraphs (Q2909240) (← links)
- COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY (Q3069732) (← links)
- A hypergraph blow-up lemma (Q3094607) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- d-matching in k-uniform hypergraphs (Q4597954) (← links)
- On Tight Cycles in Hypergraphs (Q4614939) (← links)
- Hamiltonicity in random directed graphs is born resilient (Q4993114) (← links)
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs (Q4993132) (← links)
- Minimum Degrees for Powers of Paths and Cycles (Q5048302) (← links)
- Almost all Steiner triple systems are almost resolvable (Q5135409) (← links)
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs (Q5216177) (← links)
- Tight Hamilton cycles in random hypergraphs (Q5252257) (← links)
- Minimum Vertex Degree Threshold for ‐tiling* (Q5265336) (← links)
- Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version (Q5371029) (← links)
- Transversal factors and spanning trees (Q5871277) (← links)
- Counting Hamilton cycles in Dirac hypergraphs (Q5886103) (← links)
- Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654) (← links)
- Fractional cycle decompositions in hypergraphs (Q6052479) (← links)
- Finding any given 2‐factor in sparse pseudorandom graphs efficiently (Q6055382) (← links)
- On powers of tight Hamilton cycles in randomly perturbed hypergraphs (Q6076728) (← links)
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs (Q6081575) (← links)
- Minimum degree conditions for tight Hamilton cycles (Q6133938) (← links)
- A general approach to transversal versions of Dirac‐type theorems (Q6138997) (← links)
- Dirac-type conditions for spanning bounded-degree hypertrees (Q6187344) (← links)
- Vertex degree sums for matchings in 3-uniform hypergraphs (Q6494941) (← links)
- Pósa-type results for Berge hypergraphs (Q6574381) (← links)
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems (Q6603918) (← links)
- Resilience for tight Hamiltonicity (Q6615498) (← links)
- A note on Hamilton \(\ell\)-cycle decomposition of complete \(k\)-partite hypergraphs (Q6633536) (← links)
- Transversal Hamilton cycle in hypergraph systems (Q6668348) (← links)
