The codegree Turán density of tight cycles minus one edge

Simón Piga; Marcelo Sales; Bjarne Schülke

doi:10.1017/S0963548323000196

The codegree Turán density of tight cycles minus one edge

Simón Piga^*, Marcelo Sales, Bjarne Schülke

^*Corresponding author for this work

Mathematics

Research output: Contribution to journal › Article › peer-review

44 Downloads (Pure)

Abstract

Given α>0 and an integer ℓ≥5, we prove that every sufficiently large 3 -uniform hypergraph H on n vertices in which every two vertices are contained in at least αn
edges contains a copy of C−ℓ , a tight cycle on ℓ vertices minus one edge. This improves a previous result by Balogh, Clemen, and Lidický.

Original language	English
Pages (from-to)	1-4
Journal	Combinatorics, Probability and Computing
Early online date	5 Jul 2023
DOIs	https://doi.org/10.1017/S0963548323000196
Publication status	E-pub ahead of print - 5 Jul 2023

Keywords

codegree density
hypergraphs

Access to Document

10.1017/S0963548323000196Licence: Creative Commons: Attribution (CC BY)

PigaS2023TheCodegreeFinal published version, 315 KBLicence: Creative Commons: Attribution (CC BY)

Cite this

@article{eb438cef07eb471a865b669f7c6cda8a,

title = "The codegree Tur{\'a}n density of tight cycles minus one edge",

abstract = "Given α>0 and an integer ℓ≥5, we prove that every sufficiently large 3 -uniform hypergraph H on n vertices in which every two vertices are contained in at least αn edges contains a copy of C−ℓ , a tight cycle on ℓ vertices minus one edge. This improves a previous result by Balogh, Clemen, and Lidick{\'y}.",

keywords = "codegree density, hypergraphs",

author = "Sim{\'o}n Piga and Marcelo Sales and Bjarne Sch{\"u}lke",

year = "2023",

month = jul,

day = "5",

doi = "10.1017/S0963548323000196",

language = "English",

pages = "1--4",

journal = "Combinatorics, Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

}

TY - JOUR

T1 - The codegree Turán density of tight cycles minus one edge

AU - Piga, Simón

AU - Sales, Marcelo

AU - Schülke, Bjarne

PY - 2023/7/5

Y1 - 2023/7/5

N2 - Given α>0 and an integer ℓ≥5, we prove that every sufficiently large 3 -uniform hypergraph H on n vertices in which every two vertices are contained in at least αn edges contains a copy of C−ℓ , a tight cycle on ℓ vertices minus one edge. This improves a previous result by Balogh, Clemen, and Lidický.

AB - Given α>0 and an integer ℓ≥5, we prove that every sufficiently large 3 -uniform hypergraph H on n vertices in which every two vertices are contained in at least αn edges contains a copy of C−ℓ , a tight cycle on ℓ vertices minus one edge. This improves a previous result by Balogh, Clemen, and Lidický.

KW - codegree density

KW - hypergraphs

U2 - 10.1017/S0963548323000196

DO - 10.1017/S0963548323000196

M3 - Article

SN - 0963-5483

SP - 1

EP - 4

JO - Combinatorics, Probability and Computing

JF - Combinatorics, Probability and Computing

ER -

The codegree Turán density of tight cycles minus one edge

Abstract

Keywords

Access to Document

Fingerprint

Cite this