Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths (Q6046654): Difference between revisions

@@ Property / DOI @@
-.1002/jgt.22853
@@ Property / DOI: 10.1002/jgt.22853 / rank @@
-Normal rank
@@ Property / cites work @@
+Tight cycles and regular slices in dense hypergraphs
+Normal rank
@@ Property / cites work @@
+The Hamiltonian problem and \(t\)-path traceable graphs
+Normal rank
@@ Property / cites work @@
+Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version
+Normal rank
@@ Property / cites work @@
+Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
+Normal rank
@@ Property / cites work @@
+On extremal problems of graphs and generalized graphs
+Normal rank
@@ Property / cites work @@
+Minimum Codegree Threshold for<i>C</i><sub>6</sub><sup>3</sup>-Factors in 3-Uniform Hypergraphs
+Normal rank
@@ Property / cites work @@
+Forcing large tight components in 3-graphs
@@ Property / cites work: Forcing large tight components in 3-graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On extremal hypergraphs for Hamiltonian cycles
@@ Property / cites work: On extremal hypergraphs for Hamiltonian cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Covering and tiling hypergraphs with tight cycles
@@ Property / cites work: Covering and tiling hypergraphs with tight cycles / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of perfect matchings and packings in dense hypergraphs
+Normal rank
@@ Property / cites work @@
+Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Forbidding Hamilton cycles in uniform hypergraphs
@@ Property / cites work: Forbidding Hamilton cycles in uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
+Normal rank
@@ Property / cites work @@
+Q4519896
@@ Property / cites work: Q4519896 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian chains in hypergraphs
@@ Property / cites work: Hamiltonian chains in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hypergraphs, quasi-randomness, and conditions for regularity
+Normal rank
@@ Property / cites work @@
+Hamilton \(\ell \)-cycles in uniform hypergraphs
@@ Property / cites work: Hamilton \(\ell \)-cycles in uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamilton cycles in graphs and hypergraphs: an extremal perspective
+Normal rank
@@ Property / cites work @@
+Completion and deficiency problems
@@ Property / cites work: Completion and deficiency problems / rank @@
+Normal rank
@@ Property / cites work @@
+Covering the vertices of a graph by vertex-disjoint paths
+Normal rank
@@ Property / cites work @@
+Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Q3078214
@@ Property / cites work: Q3078214 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dirac-Type Theorem for 3-Uniform Hypergraphs
@@ Property / cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Recent trends in combinatorics
@@ Property / cites work: Recent trends in combinatorics / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/JGT.22853
@@ Property / DOI: 10.1002/JGT.22853 / rank @@
+Normal rank