Pages that link to "Item:Q3373667"

The following pages link to A Dirac-Type Theorem for 3-Uniform Hypergraphs (Q3373667):

Displaying 50 items.

• The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
• Spectra of cycle and path families of oriented hypergraphs (Q2321360) (← links)
• Cyclic triangle factors in regular tournaments (Q2335694) (← links)
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs (Q2349508) (← links)
• Monochromatic Hamiltonian Berge-cycles in colored hypergraphs (Q2397546) (← links)
• The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph (Q2400547) (← links)
• On the Erdős-Hajnal problem for 3-uniform hypergraphs (Q2440004) (← links)
• Recent advances on the Hamiltonian problem: survey III (Q2441350) (← links)
• Families of triples with high minimum degree are Hamiltonian (Q2450131) (← links)
• Short paths in quasi-random triple systems with sparse underlying graphs (Q2496208) (← links)
• Co-degree density of hypergraphs (Q2642025) (← links)
• Properly colored Hamilton cycles in Dirac-type hypergraphs (Q2692184) (← links)
• Tiling multipartite hypergraphs in quasi-random hypergraphs (Q2692780) (← links)
• Hamilton cycles in quasirandom hypergraphs (Q2820275) (← links)
• On extremal hypergraphs for Hamiltonian cycles (Q2857378) (← links)
• Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments (Q2922881) (← links)
• Triangle factors of graphs without large independent sets and of weighted graphs (Q2953695) (← links)
• On Degree Sequences Forcing The Square of a Hamilton Cycle (Q2968516) (← links)
• Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs (Q2975787) (← links)
• The Complexity of Perfect Packings in Dense Graphs (Q2988829) (← links)
• The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree (Q3057634) (← links)
• The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle (Q3068812) (← links)
• TILING DIRECTED GRAPHS WITH TOURNAMENTS (Q3119461) (← links)
• Near Perfect Matchings in ${k}$-Uniform Hypergraphs II (Q3185658) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• Embedding spanning subgraphs in uniformly dense and inseparable graphs (Q3386528) (← links)
• Monochromatic Hamiltonian<i>t</i>-tight Berge-cycles in hypergraphs (Q3528158) (← links)
• Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs (Q3553234) (← links)
• A hypergraph regularity method for generalized Turán problems (Q3608316) (← links)
• Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs (Q4625033) (← links)
• Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive (Q4922129) (← links)
• Sprinkling a Few Random Edges Doubles the Power (Q4990400) (← links)
• The threshold for the square of a Hamilton cycle (Q4992907) (← links)
• Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs (Q4993132) (← links)
• Finding tight Hamilton cycles in random hypergraphs faster (Q4993260) (← links)
• Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs (Q5020839) (← links)
• Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
• Dirac-type results for tilings and coverings in ordered graphs (Q5056387) (← links)
• A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs (Q5071104) (← links)
• Squares of Hamiltonian cycles in 3‐uniform hypergraphs (Q5113942) (← links)
• Minimalist designs (Q5120741) (← links)
• The bandwidth theorem for locally dense graphs (Q5135412) (← links)
• (Q5147550) (← links)
• Powers of tight Hamilton cycles in randomly perturbed hypergraphs (Q5216177) (← links)
• An asymptotic bound for the strong chromatic number (Q5222554) (← links)
• Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles (Q5222560) (← links)
• Spanning Trees with Few Branch Vertices (Q5232165) (← links)
• Near Perfect Matchings in<i>k</i>-Uniform Hypergraphs (Q5364253) (← links)
• On Directed Versions of the Hajnal–Szemerédi Theorem (Q5364261) (← links)
• Minimum Codegree Threshold for<i>C</i>₆³-Factors in 3-Uniform Hypergraphs (Q5366961) (← links)