Lawrence Hollom

Orcid: 0009-0001-7904-1256

According to our database¹, Lawrence Hollom authored at least 7 papers between 2024 and 2026.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2026

Counterexamples to Conjectures on Strong Maximality and Minimality.

[BibT_eX]

[DOI]

Lawrence Hollom

Benedict Randall Shaw

Electron. J. Comb., 2026

2025

The bunkbed conjecture is not robust to generalisation.

[BibT_eX]

[DOI]

Lawrence Hollom

Eur. J. Comb., 2025

On graphs with maximum difference between game chromatic number and chromatic number.

[BibT_eX]

[DOI]

Lawrence Hollom

Discret. Math., 2025

A Uniform Bound on Almost Colour-Balanced Perfect Matchings in Colour-Balanced Complete Graphs.

[BibT_eX]

[DOI]

Lawrence Hollom

Electron. J. Comb., 2025

2024

A new proof of the bunkbed conjecture in the <i>p</i>↑1 limit.

[BibT_eX]

[DOI]

Lawrence Hollom

Discret. Math., January, 2024

A note on interval colourings of graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

On monotonicity in Maker-Breaker graph colouring games.

[BibT_eX]

[DOI]

Lawrence Hollom

Discret. Appl. Math., 2024

Lawrence Hollom

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...