Minimum Vertex Degree Threshold for C43-tiling*
نویسندگان
چکیده
منابع مشابه
Minimum degree threshold for bipartite graph tiling
We answer a question of Zhao [SIAM J. Disc. Math. 23 vol.2, (2009), 888-900] that determines the minimum degree threshold for a bipartite graph G to contain an H-factor (a perfect tiling of G with H) for any bipartite graph H. We also show that this threshold is best possible up to a constant depending only on H. This result can be viewed as an analog to Kuhn and Osthus' result [Combinatorica 2...
متن کاملMinimum Vertex Degree Threshold for <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"></math>tiling
We prove that the vertex degree threshold for tiling C3 4 (the 3-uniform hypergraph with four vertices and two triples) in a 3-uniform hypergraph on n ∈ 4N vertices is (n−1 2 ) − ( 4 n 2 ) + 8n + c, where c = 1 if n ∈ 8N and c = −2 otherwise. This result is best possible, and is one of the first results on vertex degree conditions for hypergraph tiling. C © 2014 Wiley Periodicals, Inc. J. Graph...
متن کاملMinimum degree thresholds for bipartite graph tiling
Given a bipartite graph H and a positive integer n such that v(H) divides 2n, we define the minimum degree threshold for bipartite H-tiling, δ2(n,H), as the smallest integer k such that every bipartite graph G with n vertices in each partition and minimum degree δ(G) ≥ k contains a spanning subgraph consisting of vertex-disjoint copies of H. Zhao, Hladký-Schacht, Czygrinow-DeBiasio determined δ...
متن کاملMinimum vertex degree thresholds for tiling complete 3-partite 3-graphs
Given positive integers a ≤ b ≤ c, let Ka,b,c be the complete 3-partite 3-uniform hypergraph with three parts of sizes a, b, c. Let H be a 3-uniform hypergraph on n vertices where n is divisible by a + b + c. We asymptotically determine the minimum vertex degree of H that guarantees a perfect Ka,b,ctiling, that is, a spanning subgraph of H consisting of vertex-disjoint copies of Ka,b,c. This pa...
متن کاملMinimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
We show that for sufficiently large n, every 3-uniform hypergraph on n vertices with minimum vertex degree at least (n−1 2 ) − (b 3 4 nc 2 ) + c, where c = 2 if n ∈ 4N and c = 1 if n ∈ 2N\4N, contains a loose Hamilton cycle. This degree condition is best possible and improves on the work of Buß, Hàn and Schacht who proved the corresponding asymptotical result.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2014
ISSN: 0364-9024
DOI: 10.1002/jgt.21833