Codegree thresholds for covering 3-uniform hypergraphs
From MaRDI portal
Abstract: Given two 3-uniform hypergraphs F and G, we say that G has an F-covering if we can cover V(G) by copies of F. The minimum codegree of G is the largest integer d such that every pair of vertices from V(G) is contained in at least d triples from E(G). Define c_2(n,F) to be the largest minimum codegree among all n-vertex 3-graphs G that contain no F-covering. This is a natural problem intermediate (but distinct) from the well-studied Tur'an problems and tiling problems. In this paper, we determine c_2(n, K_4) (for n>98) and the associated extremal configurations (for n>998), where K_4 denotes the complete 3-graph on 4 vertices. We also obtain bounds on c_2(n,F) which are apart by at most 2 in the cases where F is K_4^- (K_4 with one edge removed), K_5^-, and the tight cycle C_5 on 5 vertices.
Recommendations
- On the vertex cover number of 3-uniform hypergraph
- The size of 3-uniform hypergraphs with given matching number and codegree
- Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths
- Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs
- The codegree threshold for 3-graphs with independent neighborhoods
- Mixed covering arrays on 3-uniform hypergraphs
- On the codegree density of complete 3-graphs and related problems
- Packings and coverings of complete 3-uniform hypergraph
- Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
- Minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs
Cites work
- \(F\)-factors in hypergraphs via absorption
- A geometric theory for hypergraph matching
- A hypergraph regularity method for generalized Turán problems
- A note on codegree problems for hypergraphs
- An exact result for 3-graphs
- Co-degree density of hypergraphs
- Codegree problems for projective geometries
- Codegree thresholds for covering 3-uniform hypergraphs
- Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
- Exact minimum codegree threshold for K^-_4-factors
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 4200236 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- scientific article; zbMATH DE number 1439495 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Minimum codegree threshold for (K^3_4-e)-factors
- Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
- On the co-degree threshold for the Fano plane
- On the codegree density of complete 3-graphs and related problems
- On the Turán number of triple systems
- Packing k-partite k-uniform hypergraphs
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Recent advances on Dirac-type problems for hypergraphs
- The co-degree density of the Fano plane
- The codegree threshold for 3-graphs with independent neighborhoods
- The minimum degree threshold for perfect graph packings
- Tight co-degree condition for packing of loose cycles in 3-graphs
- Tiling 3-uniform hypergraphs with K₄^3-2e
Cited in
(17)- Covering and tiling hypergraphs with tight cycles
- Minimum codegree threshold for (K^3_4-e)-factors
- A note on codegree problems for hypergraphs
- Codegree thresholds for covering 3-uniform hypergraphs
- On the codegree density of complete 3-graphs and related problems
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
- Covering and tiling hypergraphs with tight cycles
- Dirac-type results for tilings and coverings in ordered graphs
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
- Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs
- Hypergraph Turán Problems in l2-Norm
- The degree and codegree threshold for linear triangle covering in 3-graphs
- Some results and problems on clique coverings of hypergraphs
- The degree and codegree threshold for generalized triangle and some trees covering
- The degree threshold for covering with all the connected 3-graphs with 3 edges
- Codegree conditions for (fractional) Steiner triple systems
- Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering
This page was built for publication: Codegree thresholds for covering 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2826217)
