Large Y 3, 2-tilings in 3-uniform hypergraphs
Authors: 
Jie Han, Lin Sun, Guanghui WangAuthors Info & Claims
References
[1]
Bollobás B., Daykin D.E., Erdős P., Sets of independent edges of a hypergraph, Quart. J. Math. 27 (1) (1976) 25–32.
[2]
Buß E., Hàn H., Schacht M., Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs, J. Combin. Theory Ser. B 114 (6) (2013) 658–678.
[3]
Czygrinow A., Debiasio L., Nagle B., Tiling 3-uniform hypergraphs with K 4 3 − 2 e, J. Graph Theory 75 (2) (2013) 124–136.
[4]
Diestel R., Graph Theory, in: Graduate Texts in Mathematics, vol. 173, fifth ed., Springer, Berlin, 2017, xviii+428.
[5]
Erdős P., A problem on independent r-tuples, Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 8 (1965) 93–95.
[6]
P. Erdős, Problems and results in graph theory and combinatorial analysis, in: Proceedings of the Fifth British Combinatorial Conference, 1976, pp. 169–192.
[7]
Erdős P., Gallai T., On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hung. 10 (3) (1959) 337–356.
[8]
Erdős P., Milner E.C., Rado R., Intersection theorems for systems of finite sets, Acta Math. Acad. Sci. Hung. 18 (1) (1974) 22–40.
[9]
Frankl P., Improved bounds for Erdős’ matching conjecture, J. Combin. Theory Ser. A 120 (5) (2013) 1068–1072.
[10]
Frankl P., On the maximum number of edges in a hypergraph with given matching number, Discrete Appl. Math. 216 (3) (2017) 562–581.
[11]
Frankl P., Proof of the Erdős matching conjecture in a new range, Israel J. Math. 222 (1) (2017) 421–430.
[12]
Frankl P., Füredi Z., Forbidding just one intersection, J. Combin. Theory Ser. A 39 (2) (1985) 160–176.
[13]
Frankl P., Kupavskii A., The Erdös matching conjecture and concentration inequalities, J. Combin. Theory Ser. B 157 (2022) 366–400.
[14]
Frankl P., Rödl V., Ruciński A., On the maximum number of edges in a triple system not containing a disjoint family of a given size, Combin. Probab. Comput. 21 (1,2) (2012) 141–148.
[15]
Gan L., Han J., Sun L., Wang G., Large Y k, b-tilings and Hamilton ℓ-cycles in k-uniform hypergraphs, J. Graph Theory 104 (3) (2023) 516–556.
[16]
Grosu C., Hladký J., The extremal function for partial bipartite tilings, European J. Combin. 33 (5) (2012) 807–815.
[17]
Hàn H., Schacht M., Dirac-type results for loose Hamilton cycles in uniform hypergraphs, J. Combin. Theory Ser. B 100 (3) (2010) 332–346.
[18]
J. Han, L. Sun, G. Wang, Minimum degree conditions for Hamilton ℓ-cycles in k-uniform hypergraphs, in preparation.
[19]
Han J., Zhao Y., Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs, J. Combin. Theory Ser. A 132 (2015) 194–223.
[20]
Han J., Zhao Y., Minimum vertex degree threshold for C 4 3-tiling, J. Graph Theory 79 (4) (2015) 300–317.
[21]
Han J., Zhao Y., Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs, J. Combin. Theory Ser. B 114 (2015) 70–96.
[22]
Huang H., Loh P., Sudakov B., The size of a hypergraph and its matching number, Combin. Probab. Comput. 21 (3) (2012) 442–450.
[23]
Knierim C., Su P., K r-factors in graphs with low independence number, J. Combin. Theory Ser. B 148 (2021) 60–83.
[24]
Kolupaev D., Kupavskii A., Erdős matching conjecture for almost perfect matchings, Discrete Math. 346 (4) (2023).
[25]
Kühn D., Osthus D., Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, J. Combin. Theory Ser. B 96 (6) (2006) 767–821.
[26]
Lang R., Tiling dense hypergraphs, 2023, arXiv:2308.12281.
[27]
Łuczak T., Mieczkowska K., On Erdős’ extremal problem on matchings in hypergraphs, J. Combin. Theory Ser. A 124 (2014) 178–194.
[28]
Markström K., Ruciński A., Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, European J. Combin. 32 (5) (2011) 677–687.
[29]
Szemerédi E., Regular Partitions of Graphs, In Problèmes combinatoires et théorie des graphes (Colloquial International CNRS, University Orsay, Orsay, 1976), 1978, pp. 399–401.
Recommendations
Integer and fractional packings in dense 3-uniform hypergraphs
Let I0 be any fixed 3-uniform hypergraph. For a 3-uniform hypergraph H we define vI0 (H) to be the maximum size of a set of pairwise triple-disjoint copies of I0 in H. We say a function ψ from the set of copies of I0 in H to [0, 1] is a fractional I0-...
Matching in 3-uniform hypergraphs
AbstractA matching in a 3-uniform hypergraph is a set of pairwise disjoint edges. We use E 3 ( 2 d − 1 , n − 2 d + 1 ) to denote the 3-uniform hypergraph whose vertex set can be partitioned into two vertex classes V 1 and V 2 of size 2 d − 1 and n − 2 d +...
Edge intersection graphs of linear 3-uniform hypergraphs
Let L"3^l be the class of edge intersection graphs of linear 3-uniform hypergraphs. It is known that the problem of recognition of the class L"3^l is NP-complete. We prove that this problem is polynomially solvable in the class of graphs with minimum ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Elsevier Ltd.
Publisher
Academic Press Ltd.
United Kingdom
Publication History
Published: 24 July 2024
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025