Cover Image

Discrepancies of spanning trees in dense graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hollom, Lawrence, Lichev, Lyuben, Mond, Adva, Portier, Julien
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A note on high-dimensional discrepancy of subtrees
by: Hollom, Lawrence, et al.
Published: (2024)

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

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

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

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

$d$-connectivity of the random graph with restricted budget
by: Lichev, Lyuben
Published: (2022)

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

Color-avoiding percolation on the Erdős-Rényi random graph
by: Lichev, Lyuben, et al.
Published: (2022)

Vertex-separating path systems in random graphs
by: Lichev, Lyuben, et al.
Published: (2024)

Minimum degree edge-disjoint Hamilton cycles in random directed graphs
by: Ferber, Asaf, et al.
Published: (2025)

Universality of the matching number in percolated regular graphs
by: Diskin, Sahar, et al.
Published: (2025)

Sharp thresholds, hitting times and the power of choice for random geometric graphs
by: Ignasiak, Dawid, et al.
Published: (2025)

Finding long cycles in a percolated expander graphs
by: Hollom, Lawrence
Published: (2025)

On the local resilience of random geometric graphs with respect to connectivity and long cycles
by: Díaz, Alberto Espuny, et al.
Published: (2024)

Spanning trees of bounded degree in random geometric graphs
by: Anastos, Michael, et al.
Published: (2025)

Nearly spanning cycle in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

On graphs with maximum difference between game chromatic number and chromatic number
by: Hollom, Lawrence
Published: (2023)

Dynamic random graphs with vertex removal
by: Díaz, Josep, et al.
Published: (2022)

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

The Maker-Breaker percolation game on a random board
by: Dvořák, Vojtěch, et al.
Published: (2024)

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

Colouring random Hasse diagrams and box-Delaunay graphs
by: Jin, Zhihan, et al.
Published: (2025)

Random minimum spanning tree and dense graph limits
by: Hladký, Jan, et al.
Published: (2023)

A note on monotonicity in Maker-Breaker graph colouring games
by: Hollom, Lawrence
Published: (2023)

A resolution of the Aharoni-Korman conjecture
by: Hollom, Lawrence
Published: (2024)

Hypercube geodesics with few colour changes
by: Hollom, Lawrence
Published: (2026)

The maximal running time of hypergraph bootstrap percolation
by: Hartarsky, Ivailo, et al.
Published: (2022)

Explosive appearance of cores and bootstrap percolation on lattices
by: Hartarsky, Ivailo, et al.
Published: (2025)

Tight Anti‐Concentration of Rademacher Sums
by: Lawrence Hollom, et al.
Published: (2025)

A uniform bound on almost colour-balanced perfect matchings in colour-balanced cliques
by: Hollom, Lawrence
Published: (2024)

Uniformly balanced $H$-factors in multicoloured complete graphs
by: Banerjee, Agnijo, et al.
Published: (2026)

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

The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes
by: Christoph, Micha, et al.
Published: (2026)

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

d $d$‐connectivity of the random graph with restricted budget
by: Lyuben Lichev
Published: (2024)

Percolation on dense random graphs with given degrees
by: Lichev, Lyuben, et al.
Published: (2022)

Packing and finding paths in sparse random graphs
by: Iršič, Vesna, et al.
Published: (2024)

Local dimer dynamics in higher dimensions
by: Hartarsky, Ivailo, et al.
Published: (2023)

The bunkbed conjecture is not robust to generalisation
by: Hollom, Lawrence
Published: (2024)

On the $(k+2,k)$-problem of Brown, Erdős and Sós for $k=5,6,7$
by: Glock, Stefan, et al.
Published: (2024)