:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Reiher, Christian
Format:	Preprint
Published:	2021
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2108.07297
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dense halves in balanced 2-partition of K4-free graphs
by: Xu, Yue, et al.
Published: (2024)

4K_1 free graphs on 13 vertices have cop number at most 2
by: Wu, Zhaoyu
Published: (2026)

Unavoidable subgraphs in Ramsey graphs
by: Reiher, Christian, et al.
Published: (2025)

The complete picture for clique factors in randomly perturbed graphs
by: Antoniuk, Sylwia, et al.
Published: (2026)

Large sum-free sets in finite vector spaces I
by: Reiher, Christian, et al.
Published: (2024)

Large sum-free sets in finite vector spaces II
by: Reiher, Christian, et al.
Published: (2026)

Chordal graphs, even-hole-free graphs and sparse obstructions to bounded treewidth
by: Hajebi, Sepehr
Published: (2024)

Note on the Theorem of Balog, Szemerédi, and Gowers
by: Reiher, Christian, et al.
Published: (2023)

Relative Turán densities of ordered graphs
by: Reiher, Christian, et al.
Published: (2025)

Clique factors in randomly perturbed graphs: the transition points
by: Antoniuk, Sylwia, et al.
Published: (2024)

Burning numbers via eigenpolytopes -- Hamming graphs, Johnson graphs, and halved cubes
by: Tanaka, Hajime, et al.
Published: (2025)

On the local metric dimension of $K_4$-free graphs
by: Ghalavand, Ali, et al.
Published: (2025)

Balanced bipartite distance of $K_4$-free graphs
by: Balogh, József, et al.
Published: (2026)

Obligatory hypergraphs
by: Reiher, Christian
Published: (2024)

Colouring versus density in integers and Hales-Jewett cubes
by: Reiher, Christian, et al.
Published: (2023)

The dimension of sparse and co-sparse random graph orders
by: Gao, Pu, et al.
Published: (2025)

On Lev's periodicity conjecture
by: Reiher, Christian
Published: (2024)

Subcubic $K_4$-minor-free graphs without crumby colorings
by: Pintér, József
Published: (2026)

Coloring locally sparse graphs
by: Anderson, James, et al.
Published: (2024)

Degree-choosability of proper conflict-free list coloring of sparse graphs
by: Kashima, Masaki, et al.
Published: (2026)

$K_{2,t+1}$-free graphs with many copies of $K_{t,t}$
by: Pohoata, Cosmin, et al.
Published: (2026)

Triangle-free $d$-degenerate graphs have small fractional chromatic number
by: Martinsson, Anders
Published: (2025)

Maximum spread of $K_{s,t}$-minor-free graphs
by: Linz, William, et al.
Published: (2024)

Spectral Turán problem for $t\mathcal{K}_{4}^{-}$-free unbalanced signed graphs
by: Xie, Linfeng, et al.
Published: (2026)

Truncated degree DP-colourability of $K_{2,4}$-minor free graphs
by: Lo, On-Hei Solomon, et al.
Published: (2023)

Trichotomy and $tK_m$-goodness of sparse graphs
by: Zhang, Yanbo, et al.
Published: (2025)

On Alon-Tarsi orientations of sparse graphs
by: Cho, Eun-Kyung, et al.
Published: (2025)

On endomorphism universality of sparse graph classes
by: Knauer, Kolja, et al.
Published: (2022)

On the Prague dimension of sparse random graphs
by: Joos, Felix, et al.
Published: (2025)

Blow-up lemmas for sparse graphs
by: Allen, Peter, et al.
Published: (2016)

Graphs of large girth
by: Reiher, Christian
Published: (2024)

Geometric constructions for Ramsey-Turán theory
by: Liu, Hong, et al.
Published: (2021)

Almost all $C_k$-free oriented graphs have $Θ(n)$ backwards edges
by: Liu, Jianxi, et al.
Published: (2026)

On the local metric dimension of $K_5$-free graphs
by: Ghalavand, Ali, et al.
Published: (2025)

Quasi-transitive $K_\infty$-minor free graphs
by: Hamann, Matthias
Published: (2024)

Maximum spread of $K_r$-minor free graphs
by: Wang, Wenyan, et al.
Published: (2024)

Equitable coloring of sparse graphs
by: Liu, Weichan, et al.
Published: (2024)

On the structures of {diamond, bowtie}-free graphs that do not contain an induced subdivision of $K_4$
by: Liu, Feng, et al.
Published: (2026)

Induced even cycles in locally sparse graphs
by: Ding, Laihao, et al.
Published: (2024)

A note on the width of sparse random graphs
by: Do, Tuan Anh, et al.
Published: (2022)