Back to Search Start Over

Forcing large tight components in 3-graphs.

Authors :
Georgakopoulos, Agelos
Haslegrave, John
Montgomery, Richard
Source :
European Journal of Combinatorics. Mar2019, Vol. 77, p57-67. 11p.
Publication Year :
2019

Abstract

Abstract Any n -vertex 3-graph with minimum codegree at least ⌊ n ∕ 3 ⌋ must have a spanning tight component, but immediately below this threshold it is possible for no tight component to span more than ⌈ 2 n ∕ 3 ⌉ vertices. Motivated by this observation, we ask which codegree forces a tight component of at least any given size. The corresponding function seems to have infinitely many discontinuities, but we provide upper and lower bounds, which asymptotically converge as the function nears the origin. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
01956698
Volume :
77
Database :
Academic Search Index
Journal :
European Journal of Combinatorics
Publication Type :
Academic Journal
Accession number :
133721180
Full Text :
https://doi.org/10.1016/j.ejc.2018.11.001