Imagen de Portada

A note on finding large transversals efficiently

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Anastos, Michael, Morris, Patrick
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

Partitioning problems via random processes
por: Anastos, Michael, et al.
Publicado: (2023)

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

Smoothed analysis for graph isomorphism
por: Anastos, Michael, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Hamilton transversals in tournaments
por: Chakraborti, Debsoumya, et al.
Publicado: (2023)

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

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

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

A note on digraph splitting
por: Christoph, Micha, et al.
Publicado: (2023)

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

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

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

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

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

Tight constructions for reconfigurations of independent transversals
por: Wdowinski, Ronen
Publicado: (2026)

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

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

A note on the Erdős Matching Conjecture
por: Martin, Ryan R., et al.
Publicado: (2024)

A note on the threshold numbers of cycles
por: Wang, Runze
Publicado: (2024)

A note on connectivity in directed graphs
por: Stylianou, Stelios
Publicado: (2024)

A note on piercing discrete rectangles
por: Rao, Wei
Publicado: (2026)

A note on multidimensional Ramsey numbers
por: Mubayi, Dhruv
Publicado: (2025)