Georgakopoulos, Agelos, Haslegrave, John and Montgomery, Richard (2019) Forcing large tight components in 3-graphs. European Journal of Combinatorics, 77 . pp. 57-67. doi:10.1016/j.ejc.2018.11.001

PDF WRAP-forcing-large-tight-components-3-graphs-Georgakopoulos-2018.pdf - Accepted Version Embargoed item. Restricted access to Repository staff only until 23 November 2019. Contact author directly, specifying your specific needs. - Requires a PDF viewer. Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0. Download (727Kb)

Request Changes to record.

Abstract

Any -vertex 3-graph with minimum codegree at least must have a spanning tight component, but immediately below this threshold it is possible for no tight component to span more than 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.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics
Divisions:	Faculty of Science > Mathematics
Library of Congress Subject Headings (LCSH):	Hypergraphs, Graph connectivity
Journal or Publication Title:	European Journal of Combinatorics
Publisher:	Academic Press
ISSN:	0195-6698
Official Date:	March 2019
Dates:	Date Event March 2019 Published 23 November 2018 Available 3 November 2018 Accepted
Date of first compliant deposit:	26 November 2018
Volume:	77
Page Range:	pp. 57-67
DOI:	10.1016/j.ejc.2018.11.001
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
RIOXX Funder/Project Grant:	Project/Grant ID RIOXX Funder Name Funder ID 639046 H2020 European Research Council http://dx.doi.org/10.13039/100010663
Related URLs:	Publisher

Request changes or add full text files to a record

Repository staff actions (login required)

View Item