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 50 items.
- Extension of paths and cycles for hypergraphs (Q277496) (← links)
- Bounds on the number of edges in hypertrees (Q279202) (← links)
- Cycles and matchings in randomly perturbed digraphs and hypergraphs (Q322218) (← links)
- Tight cycles in hypergraphs (Q322350) (← links)
- Improved monochromatic loose cycle partitions in hypergraphs (Q396737) (← links)
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths (Q397075) (← links)
- On extremal hypergraphs for Hamiltonian cycles (Q412248) (← links)
- Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version (Q510620) (← links)
- Tight cycles and regular slices in dense hypergraphs (Q516070) (← links)
- On the Hamiltonicity of triple systems with high minimum degree (Q521911) (← links)
- An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs (Q526237) (← links)
- Forbidding Hamilton cycles in uniform hypergraphs (Q530769) (← links)
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs (Q544011) (← links)
- Loose Hamilton cycles in hypergraphs (Q629193) (← links)
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
- Hamiltonicity in randomly perturbed hypergraphs (Q777475) (← links)
- Perfect matchings in 4-uniform hypergraphs (Q896007) (← links)
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs (Q965258) (← links)
- Hamilton \(\ell \)-cycles in uniform hypergraphs (Q986125) (← links)
- Perfect matchings in large uniform hypergraphs with large minimum collective degree (Q1024365) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs (Q1627213) (← 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)
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs (Q1677578) (← links)
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version (Q1689892) (← links)
- \(d\)-matching in 3-uniform hypergraphs (Q1690241) (← links)
- On vertex-disjoint paths in regular graphs (Q1753085) (← links)
- Hamilton cycles in hypergraphs below the Dirac threshold (Q1791707) (← links)
- \(K_r\)-factors in graphs with low independence number (Q1998757) (← links)
- Matching in 3-uniform hypergraphs (Q1999738) (← links)
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs (Q2032885) (← links)
- On Hamiltonian cycles in hypergraphs with dense link graphs (Q2040014) (← links)
- Rainbow pancyclicity in graph systems (Q2048556) (← links)
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs (Q2072182) (← links)
- A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs (Q2092337) (← links)
- Decomposing hypergraphs into cycle factors (Q2101168) (← links)
- Tight bounds for powers of Hamilton cycles in tournaments (Q2101176) (← links)
- Hamiltonian paths and cycles in some 4-uniform hypergraphs (Q2157837) (← links)
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
- 2-universality in randomly perturbed graphs (Q2178671) (← links)
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs (Q2220980) (← links)
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs (Q2258905) (← links)
- Spanning trees in random graphs (Q2326663) (← links)
- Vertex degree sums for matchings in 3-uniform hypergraphs (Q2327218) (← links)
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs (Q2349508) (← links)
- Robust Hamiltonicity of random directed graphs (Q2399348) (← links)
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph (Q2400547) (← links)
- Recent advances on the Hamiltonian problem: survey III (Q2441350) (← links)
- Families of triples with high minimum degree are Hamiltonian (Q2450131) (← links)
