:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Anastos, Michael, Morris, Patrick
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2412.05891
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The completion numbers of Hamiltonicity and pancyclicity in random graphs
by: Alon, Yahav, et al.
Published: (2023)

Robust Hamiltonicity in families of Dirac graphs
by: Anastos, Michael, et al.
Published: (2023)

A note on multicolour Ramsey numbers and random sphere graphs
by: Attwa, Yamaan, et al.
Published: (2026)

On the chromatic number of powers of subdivisions of graphs
by: Anastos, Michael, et al.
Published: (2024)

Partitioning problems via random processes
by: Anastos, Michael, et al.
Published: (2023)

Polytopes with large transversal ratio
by: Dobbins, Michael Gene, et al.
Published: (2026)

Smoothed analysis for graph isomorphism
by: Anastos, Michael, et al.
Published: (2024)

A note on transverse sets and bilinear varieties
by: Milićević, Luka
Published: (2023)

A Note on Finding Large Transversals Efficiently
by: Michael Anastos, et al.
Published: (2025)

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

Cycle lengths in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

A short proof of a central limit theorem for the order of the giant component and $k$-core
by: Anastos, Michael, et al.
Published: (2025)

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

Optimally building spanning graphs in semirandom graph processes
by: Anastos, Michael, et al.
Published: (2025)

A note on the random greedy independent set algorithm
by: Bennett, Patrick, et al.
Published: (2013)

The law of the circumference of sparse binomial random graphs
by: Anastos, Michael, et al.
Published: (2025)

A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs
by: Kathapurkar, Amarja, et al.
Published: (2025)

Slow graph bootstrap percolation II: Accelerating properties
by: Fabian, David, et al.
Published: (2023)

Slow graph bootstrap percolation III: Chain constructions
by: Fabian, David, et al.
Published: (2025)

Slow graph bootstrap percolation I: Cycles
by: Fabian, David, et al.
Published: (2023)

Extremal, enumerative and probabilistic results on ordered hypergraph matchings
by: Anastos, Michael, et al.
Published: (2023)

A note on Diagonal sequences of integer partitions
by: Neubauer, Michael, et al.
Published: (2024)

Diameter and mixing time of the giant component in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Graph bootstrap percolation -- a discovery of slowness
by: Fabian, David, et al.
Published: (2026)

Hamilton transversals in tournaments
by: Chakraborti, Debsoumya, et al.
Published: (2023)

Characterizations of transversal and fundamental transversal matroids
by: Bonin, Joseph E., et al.
Published: (2010)

A canonical Ramsey theorem for even cycles in random graphs
by: Alvarado, José D., et al.
Published: (2024)

A canonical Ramsey theorem with list constraints in random (hyper-)graphs
by: Alvarado, José D., et al.
Published: (2023)

Constructing graphs with no independent transversals
by: Haxell, Penny, et al.
Published: (2023)

A new minor-closed class of transversal matroids
by: Toft, Gerry
Published: (2025)

Stability of transversal Hamilton cycles and paths
by: Cheng, Yangyang, et al.
Published: (2024)

Universality for transversal powers of Hamilton cycles
by: Heath, Emily, et al.
Published: (2025)

Partial independent transversals in multipartite graphs
by: Haxell, Penny, et al.
Published: (2025)

Tight constructions for reconfigurations of independent transversals
by: Wdowinski, Ronen
Published: (2026)

On a transversal theorem of Montejano and Karasev
by: Holmsen, Andreas F.
Published: (2021)

A note on digraph splitting
by: Christoph, Micha, et al.
Published: (2023)

A note on large torsion in $\mathbb{Q}$-acyclic complexes
by: Werf, Andrew Vander
Published: (2024)

A cyclic flat embedding theorem for transversal $q$-matroids
by: Fulcher, Andrew
Published: (2026)

Almost-full transversals in equi-$n$-squares
by: Chakraborti, Debsoumya, et al.
Published: (2024)

On the $d$-transversal number of cylindrical and toroidal grids
by: Wu, Hailun, et al.
Published: (2025)