Lawrence Hollom

From MaRDI portal
Person:6056424



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Double-jump phase transition for the reverse Littlewood-Offord problem
Journal of the London Mathematical Society. Second Series
2026-05-27Paper
Counterexamples to conjectures on strong maximality and minimality
The Electronic Journal of Combinatorics
2026-04-29Paper
A uniform bound on almost colour-balanced perfect matchings in colour-balanced complete graphs
The Electronic Journal of Combinatorics
2026-02-04Paper
Uniformly balanced H-factors in multicoloured complete graphs
(available as arXiv preprint)
2026-01-01Paper
Hypercube geodesics with few colour changes
(available as arXiv preprint)
2026-01-01Paper
The structure of FAC posets and the Aharoni--Korman conjecture
(available as arXiv preprint)
2026-01-01Paper
Approximate Itai-Zehavi conjecture for random graphs
Random Structures & Algorithms
2026-01-01Paper
Monotonicity and decompositions of random regular graphs
The Annals of Applied Probability
2026-01-01Paper
Tight anti-concentration of Rademacher sums
Random Structures & Algorithms
2025-08-29Paper
The bunkbed conjecture is not robust to generalisation
European Journal of Combinatorics
2025-07-16Paper
Double-jump phase transition for the reverse Littlewood--Offord problem
(available as arXiv preprint)
2025-01-01Paper
Monotonicity and decompositions of random regular graphs
(available as arXiv preprint)
2025-01-01Paper
Finding long cycles in a percolated expander graphs
(available as arXiv preprint)
2025-01-01Paper
Approximate Itai-Zehavi conjecture for random graphs
(available as arXiv preprint)
2025-01-01Paper
Connecting hypercube 1-factors
(available as arXiv preprint)
2025-01-01Paper
Reverse Littlewood--Offord problems with parity conditions
(available as arXiv preprint)
2025-01-01Paper
Counterexamples to conjectures on strong maximality and minimality
(available as arXiv preprint)
2025-01-01Paper
On graphs with maximum difference between game chromatic number and chromatic number
Discrete Mathematics
2024-12-02Paper
A note on interval colourings of graphs
European Journal of Combinatorics
2024-07-08Paper
On monotonicity in maker-breaker graph colouring games
Discrete Applied Mathematics
2024-02-27Paper
The bunkbed conjecture is not robust to generalisation
(available as arXiv preprint)
2024-01-01Paper
Almost colour-balanced spanning forests in complete graphs
(available as arXiv preprint)
2024-01-01Paper
A uniform bound on almost colour-balanced perfect matchings in colour-balanced cliques
(available as arXiv preprint)
2024-01-01Paper
Discrepancies of spanning trees in dense graphs
(available as arXiv preprint)
2024-01-01Paper
A resolution of the Aharoni-Korman conjecture
(available as arXiv preprint)
2024-01-01Paper
A note on high-dimensional discrepancy of subtrees
(available as arXiv preprint)
2024-01-01Paper
On conjectures concerning the graph grabbing game2023-11-02Paper
A new proof of the bunkbed conjecture in the \(p \uparrow 1\) limit
Discrete Mathematics
2023-10-30Paper
On graphs with maximum difference between game chromatic number and chromatic number2023-09-04Paper
Tight lower bounds for anti-concentration of Rademacher sums and Tomaszewski's counterpart problem2023-06-13Paper
On interval colourings of graphs2023-03-09Paper
A note on interval colourings of graphs2023-03-08Paper
On interval colourings of graphs
(available as arXiv preprint)
2023-01-01Paper
Tight lower bounds for anti-concentration of Rademacher sums and Tomaszewski's counterpart problem
(available as arXiv preprint)
2023-01-01Paper
On conjectures concerning the graph grabbing game
(available as arXiv preprint)
2023-01-01Paper


Research outcomes over time


This page was built for person: Lawrence Hollom