Pages that link to "Item:Q3373667"
From MaRDI portal
The following pages link to A Dirac-Type Theorem for 3-Uniform Hypergraphs (Q3373667):
Displaying 39 items.
- Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version (Q5371029) (← links)
- Exact Minimum Codegree Threshold for <i>K</i><sup>−</sup><sub>4</sub>-Factors (Q5373833) (← links)
- (Q5383282) (← links)
- Pósa's conjecture for graphs of order at least 2 × 10<sup>8</sup> (Q5388972) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)
- Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree (Q5854457) (← links)
- Counting Hamilton cycles in Dirac hypergraphs (Q5886103) (← links)
- Transversal <i>C<sub>k</sub></i>-factors in subgraphs of the balanced blow-up of <i>C<sub>k</sub></i> (Q5886351) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- Edge-decompositions of graphs with high minimum degree (Q5890900) (← links)
- Edge-decompositions of graphs with high minimum degree (Q5899605) (← links)
- Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654) (← links)
- Rainbow spanning structures in graph and hypergraph systems (Q6052079) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- Finding any given 2‐factor in sparse pseudorandom graphs efficiently (Q6055382) (← links)
- Longest cycles in 3‐connected hypergraphs and bipartite graphs (Q6057665) (← links)
- Factors in randomly perturbed hypergraphs (Q6074679) (← links)
- Covering cycles in sparse graphs (Q6074700) (← links)
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs (Q6074706) (← 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)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- Minimum degree conditions for tight Hamilton cycles (Q6133938) (← links)
- F$F$‐factors in Quasi‐random Hypergraphs (Q6134524) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
- A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs (Q6170800) (← links)
- Graph and hypergraph packing (Q6198635) (← links)
- Cycle-factors in oriented graphs (Q6565819) (← links)
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs (Q6596385) (← links)
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems (Q6603918) (← links)
- Resilience for tight Hamiltonicity (Q6615498) (← links)
- Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs (Q6621151) (← links)
- Powers of Hamiltonian cycles in \(\mu\)-inseparable graphs (Q6621194) (← links)
- Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs (Q6621258) (← links)
- A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs (Q6632775) (← links)
- On oriented cycles in randomly perturbed digraphs (Q6632800) (← links)
- A note on Hamilton \(\ell\)-cycle decomposition of complete \(k\)-partite hypergraphs (Q6633536) (← links)
- Spanning subdivisions in dense digraphs (Q6655689) (← links)
- Transversal Hamilton cycle in hypergraph systems (Q6668348) (← links)
