The following pages link to (Q3078214):
Displayed 50 items.
- Tight cycles in hypergraphs (Q322350) (← links)
- Perfect matchings in 3-partite 3-uniform hypergraphs (Q406558) (← links)
- On extremal hypergraphs for Hamiltonian cycles (Q412248) (← links)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641) (← links)
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs (Q439060) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- Tight cycles and regular slices in dense hypergraphs (Q516070) (← links)
- On the Hamiltonicity of triple systems with high minimum degree (Q521911) (← links)
- Forbidding Hamilton cycles in uniform hypergraphs (Q530769) (← links)
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
- Hamiltonicity in randomly perturbed hypergraphs (Q777475) (← links)
- Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering (Q785570) (← links)
- Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) (← links)
- Perfect matchings in 4-uniform hypergraphs (Q896007) (← links)
- Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs (Q1627213) (← links)
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs (Q1671670) (← links)
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version (Q1689892) (← links)
- \(d\)-matching in 3-uniform hypergraphs (Q1690241) (← links)
- Hamilton cycles in hypergraphs below the Dirac threshold (Q1791707) (← links)
- Hamilton saturated hypergraphs of essentially minimum size (Q1953507) (← links)
- On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs (Q2032871) (← 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)
- Hamiltonicity in cherry-quasirandom 3-graphs (Q2122670) (← links)
- Dirac-type theorems in random hypergraphs (Q2131868) (← links)
- A Dirac-type theorem for Berge cycles in random hypergraphs (Q2194091) (← links)
- Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles (Q2195224) (← 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)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Co-degrees resilience for perfect matchings in random hypergraphs (Q2294109) (← links)
- Rainbow factors in hypergraphs (Q2299634) (← links)
- Vertex degree sums for matchings in 3-uniform hypergraphs (Q2327218) (← links)
- \(F\)-factors in hypergraphs via absorption (Q2345534) (← links)
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs (Q2349508) (← links)
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture (Q2397107) (← links)
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph (Q2400547) (← links)
- Families of triples with high minimum degree are Hamiltonian (Q2450131) (← links)
- Properly colored Hamilton cycles in Dirac-type hypergraphs (Q2692184) (← links)
- Codegree Thresholds for Covering 3-Uniform Hypergraphs (Q2826217) (← links)
- (Q2857378) (← links)
- (Q2857450) (← links)
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs (Q2975787) (← 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)
- Almost Perfect Matchings in $k$-Partite $k$-Graphs (Q4605443) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Nearly Perfect Matchings in Uniform Hypergraphs (Q4990402) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)