:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Hodor, Jędrzej, Illingworth, Freddie, Mazur, Tomasz
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2508.04445
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Local dimension of a Boolean lattice
by: Hodor, Jędrzej, et al.
Published: (2025)

The Zarankiewicz problem on tripartite graphs
by: Di Braccio, Francesco, et al.
Published: (2024)

Centered colorings in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Sample compression schemes for balls in structurally sparse graphs
by: Bourneuf, Romain, et al.
Published: (2026)

Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)

Counterexamples to statements on isometric graph coverings
by: Bastide, Paul, et al.
Published: (2025)

Product structure of graphs with an excluded minor
by: Illingworth, Freddie, et al.
Published: (2021)

Tight bound on treedepth in terms of pathwidth and longest path
by: Hatzel, Meike, et al.
Published: (2023)

Navigating Posets with Few Maps
by: Felsner, Stefan, et al.
Published: (2026)

Relative Turán densities for ordered graphs: all and nothing
by: Illingworth, Freddie, et al.
Published: (2025)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

Cube Height, Cube Width and Related Extremal Problems for Posets
by: Bastide, Paul, et al.
Published: (2025)

Excluding an apex-forest or a fan as quickly as possible
by: Claus, Quentin, et al.
Published: (2026)

Quickly excluding an apex-forest
by: Hodor, Jędrzej, et al.
Published: (2024)

Dominating $K_t$-Models
by: Illingworth, Freddie, et al.
Published: (2024)

Counting Unions of Schreier Sets
by: Beanland, Kevin, et al.
Published: (2022)

Boolean dimension of a Boolean lattice
by: Briański, Marcin, et al.
Published: (2023)

Planarity and dimension I
by: Blake, Heather Smith, et al.
Published: (2025)

A coarse Gallai theorem
by: Distel, Marc, et al.
Published: (2026)

Computing Treedepth Obstructions
by: Kühn, Kolja
Published: (2025)

Non-Homotopic Drawings of Multigraphs
by: Girão, António, et al.
Published: (2024)

Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
by: Bonnet, Édouard, et al.
Published: (2023)

When $t$-intersecting hypergraphs admit bounded $c$-strong colourings
by: Hendrey, Kevin, et al.
Published: (2024)

Fat minors cannot be thinned (by quasi-isometries)
by: Davies, James, et al.
Published: (2024)

Erdős-Gyárfás conjecture on graphs without long induced paths
by: Hegde, Anand Shripad, et al.
Published: (2024)

Packing coloring of graphs with long paths
by: Furmańczyk, Hanna, et al.
Published: (2025)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
by: Adler, Isolde, et al.
Published: (2025)

Exponential odd-distance sets under the Manhattan metric
by: Díaz, Alberto Espuny, et al.
Published: (2024)

Spanning spheres in Dirac hypergraphs
by: Illingworth, Freddie, et al.
Published: (2024)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
by: Le, Hoang-Oanh, et al.
Published: (2023)

The number of induced paths in outerplanar graphs
by: Wang, Yichen, et al.
Published: (2026)

Three-coloring triangle-free graphs without long forbidden paths
by: Zhou, Yidong, et al.
Published: (2025)

The high order spectral radius of graphs without long cycles or paths
by: Wang, Yuntian, et al.
Published: (2025)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

Long induced paths in $K_{s, s}$-free graphs
by: Hunter, Zach, et al.
Published: (2024)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

Antidirected paths in oriented graphs
by: Grzesik, Andrzej, et al.
Published: (2025)

The Dominating 4-Colour Theorem
by: Girão, António, et al.
Published: (2026)

Counting Hamiltonian paths between prescribed vertices in traceable graphs with a forbidden induced subgraph
by: Jooken, Jorik, et al.
Published: (2026)