:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Iršič, Vesna, Portier, Julien, Versteegen, Leo
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2409.02812
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Packing Paths in Sparse Random Graphs
by: Vesna Iršič Chenoweth, et al.
Published: (2025)

On the number of minimum dominating sets and total dominating sets in forests
by: Petr, Jan, et al.
Published: (2022)

Upper bounds for linear graph codes
by: Versteegen, Leo
Published: (2023)

Cliques in minimally globally rigid graphs
by: Portier, Julien
Published: (2026)

The asymptotic of off-diagonal online Ramsey numbers for paths
by: Mond, Adva, et al.
Published: (2023)

A proof of a conjecture of Erdős and Gyárfás on monochromatic path covers
by: Pokrovskiy, Alexey, et al.
Published: (2024)

A note on interval colourings of graphs
by: Axenovich, Maria, et al.
Published: (2023)

Global rigidity of random graphs in $\mathbb{R}$
by: Montgomery, Richard, et al.
Published: (2024)

Around the positive graph conjecture
by: Conlon, David, et al.
Published: (2024)

Complexity of the game connected domination problem
by: Chenoweth, Vesna Iršič
Published: (2024)

Approximate Itai-Zehavi conjecture for random graphs
by: Hollom, Lawrence, et al.
Published: (2025)

Weighted Padovan graphs
by: Chenoweth, Vesna Iršič, et al.
Published: (2024)

Reconstructing a giant component of a point set in $\mathbb{R}$
by: Portier, Julien
Published: (2026)

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

Monotonicity and decompositions of random regular graphs
by: Hollom, Lawrence, et al.
Published: (2025)

Almost colour-balanced spanning forests in complete graphs
by: Hollom, Lawrence, et al.
Published: (2024)

Revisiting $d$-distance (independent) domination in trees and in bipartite graphs
by: Bujtás, Csilla, et al.
Published: (2025)

Localization game capture time of trees and outerplanar graphs
by: Chenoweth, Vesna Iršič, et al.
Published: (2025)

Improved bounds for the dimension of divisibility
by: Souza, Victor, et al.
Published: (2022)

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

$k$-Hyperopic Cops and Robber
by: Crawford, Nicholas, et al.
Published: (2024)

Discrepancies of spanning trees in dense graphs
by: Hollom, Lawrence, et al.
Published: (2024)

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

Embedding trees using minimum and maximum degree conditions
by: Pokrovskiy, Alexey, et al.
Published: (2025)

Nearly tight bounds for MaxCut in hypergraphs
by: Janzer, Oliver, et al.
Published: (2025)

Cop number of partial cubes
by: Crawford, Nicholas, et al.
Published: (2025)

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

The sandglass conjecture beyond cancellative pairs
by: Mond, Adva, et al.
Published: (2025)

General position polynomials
by: Iršič, Vesna, et al.
Published: (2024)

The capture time in the game of cops and many robbers
by: Gyergyek, Miha, et al.
Published: (2025)

On the interval coloring impropriety of graphs
by: Carr, MacKenzie, et al.
Published: (2023)

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

On $d$-distance $p$-packing domination number in strong products
by: Bujtás, Csilla, et al.
Published: (2025)

The $d$-distance $p$-packing domination number: complexity, cycles, and trees
by: Bujtás, Csilla, et al.
Published: (2025)

Tight bounds for expected propagation time of probabilistic zero forcing
by: Jelassi, Mehdi, et al.
Published: (2025)

Double-jump phase transition for the reverse Littlewood--Offord problem
by: Hollom, Lawrence, et al.
Published: (2025)

An exploration of the balance game
by: Dorbec, Paul, et al.
Published: (2024)

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

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)