Which graphs can be counted in C₄-free graphs?
METADATA ONLY
Loading...
Author / Producer
Date
2022
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
For which graphs F is there a sparse F-counting lemma in C₄-free graphs? We are interested in identifying graphs F with the property that, roughly speaking, if G is an n-vertex C₄-free graph with on the order of n³/² edges, then the density of F in G, after a suitable normalization, is approximately at least the density of F in an e-regular approximation of G. In recent work, motivated by applications in extremal and additive combinatorics, we showed that C₅ has this property. Here we construct a family of graphs with the property.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
18 (6)
Pages / Article No.
2413 - 2432
Publisher
International Press of Boston
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
Notes
Funding
196965 - Problems in Extremal and Probabilistic Combinatorics (SNF)