English

K_4-free graphs have sparse halves

Combinatorics 2024-10-08 v2
Authors: Christian Reiher
View on arXiv ↗ PDF ↗ DOI ↗

Abstract

Every K4K_4-free graph on nn vertices has a set of ⌊n/2⌋\lfloor n/2\rfloor vertices spanning at most n2/18n^2/18 edges.

Keywords

graph theory

Cite

@article{arxiv.2108.07297,
  title  = {K_4-free graphs have sparse halves},
  author = {Christian Reiher},
  journal= {arXiv preprint arXiv:2108.07297},
  year   = {2024}
}

Comments

Second version addresses referee report

Related papers

View all related →
Combinatorics · Mathematics
Sparse halves in $K_4$-free graphs
Xizhi Liu, Jie Ma
2020-07-30
Combinatorics · Mathematics
On the number of edge-disjoint triangles in $K_4$-free graphs
Ervin Győri, Balázs Keszegh
2015-06-11
Combinatorics · Mathematics
The K_4-free process
Guy Wolfovitz
2010-08-25
Combinatorics · Mathematics
Sparse halves in dense triangle-free graphs
Sergey Norin, Liana Yepremyan
2015-02-12
Combinatorics · Mathematics
Dense halves in balanced 2-partition of K4-free graphs
Yue Xu, Xiao-Dong Zhang
2024-12-19
Combinatorics · Mathematics
Extremal $K_4$-minor-free graphs without short cycles
János Barát
2021-11-11
Combinatorics · Mathematics
10 Problems for Partitions of Triangle-free Graphs
József Balogh, Felix Christian Clemen, Bernard Lidický
2026-02-17
Combinatorics · Mathematics
Sparse hypergraphs with low independence number
Jeff Cooper, Dhruv Mubayi
2014-07-24
Combinatorics · Mathematics
$K_{4}$-Minor-Free Induced Subgraphs of Sparse Connected Graphs
Gwenaël Joret, David R. Wood
2018-02-15
Combinatorics · Mathematics
On the number of $K_4$-saturating edges
József Balogh, Hong Liu
2014-11-18
Combinatorics · Mathematics
Making a K_4-free graph bipartite
Benny Sudakov
2007-06-29
Combinatorics · Mathematics
Balanced bipartite distance of $K_4$-free graphs
József Balogh, Ignacy Buczek, Andrzej Grzesik, Piotr Kuc
2026-05-08
Combinatorics · Mathematics
A characterization of $K_{2,4}$-minor-free graphs
M. N. Ellingham, Emily A. Marshall, Kenta Ozeki, Shoichi Tsuchiya
2016-02-22
Combinatorics · Mathematics
More about sparse halves in triangle-free graphs
Alexander Razborov
2022-04-06
Combinatorics · Mathematics
The edge spectrum of $K_4^-$-saturated graphs
Jun Gao, Xinmin Hou, Yue Ma
2018-04-30
Combinatorics · Mathematics
Sparse Sets in Triangle-free Graphs
Tınaz Ekim, Burak Nur Erdem, John Gimbel
2025-06-17
Combinatorics · Mathematics
Sparsity of 3-flow critical graphs
Zdeněk Dvořák, Sergey Norin
2024-04-02
Combinatorics · Mathematics
Dismantling sparse random graphs
Svante Janson, Andrew Thomason
2007-09-13
Combinatorics · Mathematics
Fullerene graphs of small diameter
Diego Nicodemos, Matěj Stehlík
2017-09-22
Computational Geometry · Computer Science
Saturated simple and 2-simple topological graphs with few edges
Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
2016-02-22
Combinatorics · Mathematics
Which graphs can be counted in $C_4$-free graphs?
David Conlon, Jacob Fox, Benny Sudakov, Yufei Zhao
2021-06-08
Combinatorics · Mathematics
The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs
Emily Abernethy Marshall, Liana Yepremyan, Zach Gaslowitz
2015-08-24
Combinatorics · Mathematics
Sparse graphs with no polynomial-sized anticomplete pairs
Maria Chudnovsky, Jacob Fox, Alex Scott, Paul Seymour +1
2020-12-08
Combinatorics · Mathematics
Maximum 4-degenerate subgraph of a planar graph
Robert Lukoťka, Ján Mazák, Xuding Zhu
2013-10-07
Combinatorics · Mathematics
Spanning trails with maximum degree at most 4 in $2K_2$-free graphs
Guantao Chen, M. N. Ellingham, Akira Saito, Songling Shan
2016-09-29
R2 v1 2026-06-24T05:09:54.583Z