Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Forcing large tight components in 3-graphs

Tools
- Tools
+ Tools

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 ISSN 0195-6698.

[img]
Preview
PDF
WRAP-forcing-large-tight-components-3-graphs-Georgakopoulos-2018.pdf - Accepted Version - Requires a PDF viewer.
Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0.

Download (727Kb) | Preview
Official URL: https://doi.org/10.1016/j.ejc.2018.11.001

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, Engineering and Medicine > 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:
DateEvent
March 2019Published
23 November 2018Available
3 November 2018Accepted
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
Date of first compliant deposit: 26 November 2018
Date of first compliant Open Access: 23 November 2019
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
639046H2020 European Research Councilhttp://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 View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us