Image de couverture de livre

A note on high-dimensional discrepancy of subtrees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hollom, Lawrence, Lichev, Lyuben, Mond, Adva, Portier, Julien
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Discrepancies of spanning trees in dense graphs
par: Hollom, Lawrence, et autres
Publié: (2024)

Approximate Itai-Zehavi conjecture for random graphs
par: Hollom, Lawrence, et autres
Publié: (2025)

Monotonicity and decompositions of random regular graphs
par: Hollom, Lawrence, et autres
Publié: (2025)

Almost colour-balanced spanning forests in complete graphs
par: Hollom, Lawrence, et autres
Publié: (2024)

The asymptotic of off-diagonal online Ramsey numbers for paths
par: Mond, Adva, et autres
Publié: (2023)

Double-jump phase transition for the reverse Littlewood--Offord problem
par: Hollom, Lawrence, et autres
Publié: (2025)

$d$-connectivity of the random graph with restricted budget
par: Lichev, Lyuben
Publié: (2022)

Color-avoiding percolation on the Erdős-Rényi random graph
par: Lichev, Lyuben, et autres
Publié: (2022)

Vertex-separating path systems in random graphs
par: Lichev, Lyuben, et autres
Publié: (2024)

A note on monotonicity in Maker-Breaker graph colouring games
par: Hollom, Lawrence
Publié: (2023)

The Maker-Breaker percolation game on a random board
par: Dvořák, Vojtěch, et autres
Publié: (2024)

Minimum degree edge-disjoint Hamilton cycles in random directed graphs
par: Ferber, Asaf, et autres
Publié: (2025)

A resolution of the Aharoni-Korman conjecture
par: Hollom, Lawrence
Publié: (2024)

Sharp thresholds, hitting times and the power of choice for random geometric graphs
par: Ignasiak, Dawid, et autres
Publié: (2025)

The sandglass conjecture beyond cancellative pairs
par: Mond, Adva, et autres
Publié: (2025)

Universality of the matching number in percolated regular graphs
par: Diskin, Sahar, et autres
Publié: (2025)

A note on interval colourings of graphs
par: Axenovich, Maria, et autres
Publié: (2023)

Hypercube geodesics with few colour changes
par: Hollom, Lawrence
Publié: (2026)

On the local resilience of random geometric graphs with respect to connectivity and long cycles
par: Díaz, Alberto Espuny, et autres
Publié: (2024)

Finding long cycles in a percolated expander graphs
par: Hollom, Lawrence
Publié: (2025)

The maximal running time of hypergraph bootstrap percolation
par: Hartarsky, Ivailo, et autres
Publié: (2022)

A uniform bound on almost colour-balanced perfect matchings in colour-balanced cliques
par: Hollom, Lawrence
Publié: (2024)

Explosive appearance of cores and bootstrap percolation on lattices
par: Hartarsky, Ivailo, et autres
Publié: (2025)

Tight Anti‐Concentration of Rademacher Sums
par: Lawrence Hollom, et autres
Publié: (2025)

On graphs with maximum difference between game chromatic number and chromatic number
par: Hollom, Lawrence
Publié: (2023)

The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes
par: Christoph, Micha, et autres
Publié: (2026)

Dynamic random graphs with vertex removal
par: Díaz, Josep, et autres
Publié: (2022)

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

Cliques in minimally globally rigid graphs
par: Portier, Julien
Publié: (2026)

Local dimer dynamics in higher dimensions
par: Hartarsky, Ivailo, et autres
Publié: (2023)

The bunkbed conjecture is not robust to generalisation
par: Hollom, Lawrence
Publié: (2024)

Colouring random Hasse diagrams and box-Delaunay graphs
par: Jin, Zhihan, et autres
Publié: (2025)

On the $(k+2,k)$-problem of Brown, Erdős and Sós for $k=5,6,7$
par: Glock, Stefan, et autres
Publié: (2024)

Reverse Littlewood--Offord problems with parity conditions
par: Hollom, Lawrence, et autres
Publié: (2025)

Counterexamples to conjectures on strong maximality and minimality
par: Hollom, Lawrence, et autres
Publié: (2025)

Spanning trees of bounded degree in random geometric graphs
par: Anastos, Michael, et autres
Publié: (2025)

Nearly tight bounds for MaxCut in hypergraphs
par: Janzer, Oliver, et autres
Publié: (2025)

Double‐jump phase transition for the reverse Littlewood–Offord problem
par: Lawrence Hollom, et autres
Publié: (2026)

The vertex sets of subtrees of a tree
par: Chudnovsky, Maria, et autres
Publié: (2025)

Benjamini-Schramm convergence and subtrees of trees
par: Cambie, Stijn, et autres
Publié: (2026)