:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Rosenfeld, Matthieu
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics
Online Access:	https://arxiv.org/abs/2407.18113
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An explicit condition for boundedly supermultiplicative subshifts
by: Bui, Vuong, et al.
Published: (2024)

The lonely runner conjecture holds for eight runners
by: Rosenfeld, Matthieu
Published: (2025)

The lonely runner conjecture holds for nine runners
by: Rosenfeld, Matthieu
Published: (2025)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

Local obstructions in sequences revisited
by: Rosenfeld, Matthieu, et al.
Published: (2025)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
by: Gutin, Gregory, et al.
Published: (2024)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
by: Tiskin, Alexander
Published: (2022)

On multiplicities of interpoint distances
by: Clemen, Felix Christian, et al.
Published: (2025)

A note on distance-hereditary graphs whose complement is also distance-hereditary
by: Jacob, Hugo
Published: (2025)

The average size of maximal matchings in graphs
by: Hertz, Alain, et al.
Published: (2022)

Isomorphisms of unit distance graphs of layers
by: Bikeev, Arthur Igorevich
Published: (2025)

Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)

Some polynomial classes for the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2026)

Quasi-linear distance query reconstruction for graphs of bounded treelength
by: Bastide, Paul, et al.
Published: (2024)

A note on the distinct distances problem over finite fields
by: Brukhim, Nataly, et al.
Published: (2025)

Upper Bounds on the Average Height of Random Binary Trees
by: Benkner, Louisa Seelbach
Published: (2024)

An Upper Bound on the Linear Turán Number of $k$-Crowns
by: Adak, Rajat
Published: (2026)

Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
by: Anto, Nevil, et al.
Published: (2023)

Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
by: La, Hoang, et al.
Published: (2021)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
by: Laddha, Aditi, et al.
Published: (2025)

An improvement on the bound for the acyclic chromatic index
by: Kirousis, Lefteris, et al.
Published: (2026)

On the edge expansion of random polytopes
by: Ferber, Asaf, et al.
Published: (2025)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

Long induced paths and forbidden patterns: Polylogarithmic bounds
by: Duron, Julien, et al.
Published: (2024)

Tight bound for the Erdős-Pósa property of tree minors
by: Dujmović, Vida, et al.
Published: (2024)

Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025)

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

New bounds for proper $h$-conflict-free colourings
by: Chuet, Quentin, et al.
Published: (2025)

Increasing arc-connectivity by bounded- and fixed-size inversions
by: Hörsch, Florian, et al.
Published: (2026)

Bounded twin-width graphs are polynomially $χ$-bounded
by: Bourneuf, Romain, et al.
Published: (2023)

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

Canonical labelling of sparse random graphs
by: Verbitsky, Oleg, et al.
Published: (2024)

Twin-width of sparse random graphs
by: Hendrey, Kevin, et al.
Published: (2023)

A Caro-Wei bound for induced linear forests in graphs
by: Joret, Gwenaël, et al.
Published: (2024)

On expectations and variances in the hard-core model on bounded degree graphs
by: Davies, Ewan, et al.
Published: (2025)

Improved lower bounds on the maximum size of graphs with girth 5
by: Goedgebeur, Jan, et al.
Published: (2025)

A polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2026)