Cover Image

Almost colour-balanced spanning forests in complete graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hollom, Lawrence, 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

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

A note on high-dimensional discrepancy of subtrees
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)

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

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

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

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

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

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

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

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

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

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)

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

Local limit of massive spanning forests on the complete graph
by: D'Achille, Matteo, et al.
Published: (2024)

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

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

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

Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles
by: Lo, Allan, et al.
Published: (2023)

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

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

On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
by: Wang, Wei, et al.
Published: (2026)

On almost Gallai colourings in complete graphs
by: Grebennikov, Alexandr, et al.
Published: (2025)

Reverse Littlewood--Offord problems with parity conditions
by: Hollom, Lawrence, et al.
Published: (2025)

Counterexamples to conjectures on strong maximality and minimality
by: Hollom, Lawrence, et al.
Published: (2025)

Partitions of complete twisted graphs into plane spanning trees
by: Figueroa, Ana Paulina, et al.
Published: (2025)

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

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

Monochromatic odd cycles in edge-coloured complete graphs
by: Girão, António, et al.
Published: (2024)

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

Connecting hypercube 1-factors
by: Hollom, Lawrence, et al.
Published: (2025)

On asymptotic values for the minimum number of spanning forests in simple regular graphs
by: Xu, Shaohan, et al.
Published: (2026)

The diameter of random spanning trees interpolating between the UST and the MST of the complete graph
by: Kúsz, Ágnes
Published: (2024)

On problems in extremal multigraph theory
by: Falgas-Ravry, Victor, et al.
Published: (2025)

Almost spanning distance trees in subsets of finite vector spaces
by: Chakraborti, Debsoumya, et al.
Published: (2023)

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