Imagen de Portada

Advancing the Rödl Nibble: New bounds on matchings and the list chromatic index of hypergraphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gould, Stephen, Kelly, Tom
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree
por: Kang, Dong Yeap, et al.
Publicado: (2021)

Perfect matchings in random sparsifications of Dirac hypergraphs
por: Kang, Dong Yeap, et al.
Publicado: (2022)

Sharp bounds for rainbow matchings in hypergraphs
por: Pohoata, Cosmin, et al.
Publicado: (2022)

About Berge-Füredi's conjecture on the chromatic index of hypergraphs
por: Bretto, Alain, et al.
Publicado: (2024)

On hypergraph Turán problems with bounded matching number
por: Gerbner, Dániel, et al.
Publicado: (2024)

The Berge-Füredi conjecture on the chromatic index of hypergraphs with large hyperedges
por: Bretto, Alain, et al.
Publicado: (2024)

An improvement on the bound for the acyclic chromatic index
por: Kirousis, Lefteris, et al.
Publicado: (2026)

Strong list-chromatic index of subcubic graphs is at most 10
por: Tang, Yunfang, et al.
Publicado: (2025)

Three-chromatic geometric hypergraphs
por: Damásdi, Gábor, et al.
Publicado: (2021)

A note on improved bounds for hypergraph rainbow matching problems
por: Bowtell, Candida, et al.
Publicado: (2025)

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials
por: Dong, Fengming, et al.
Publicado: (2023)

A New Proof of the Nešetřil-Rödl Theorem
por: Masulovic, Dragan
Publicado: (2017)

The chromatic number of triangle-free hypergraphs
por: Li, Lina, et al.
Publicado: (2022)

Equivalence between Erdős-Hajnal and polynomial Rödl and Nikiforov conjectures
por: Bucić, Matija, et al.
Publicado: (2024)

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)
por: Dong, Fengming, et al.
Publicado: (2022)

On degree bounds of $k$-uniform hypergraphs with bounded matching number
por: Zhang, Haixiang, et al.
Publicado: (2026)

Random matchings in linear hypergraphs
por: Lee, Hyunwoo
Publicado: (2024)

Discrepancies of perfect matchings in hypergraphs
por: Lu, Hongliang, et al.
Publicado: (2024)

DP color functions versus chromatic polynomials for hypergraphs (I)
por: Cui, Ruiyi, et al.
Publicado: (2026)

Counting sunflowers in hypergraphs with bounded matching number and Erdős Matching Conjecture in the $(t,k)$-norm
por: Zhou, Junpeng, et al.
Publicado: (2026)

New bounds of two hypergraph Ramsey problems
por: Fan, Chunchao, et al.
Publicado: (2024)

Upper bounds for the list-distinguishing chromatic number
por: Banerjee, Amitayu, et al.
Publicado: (2024)

Colour-bias perfect matchings in hypergraphs
por: Hàn, Hiêp, et al.
Publicado: (2024)

Perturbation of the largest matching root of hypergraphs
por: Wan, Jiang-Chao, et al.
Publicado: (2026)

On the mod $k$ chromatic index of graphs
por: Nweit, Oothan, et al.
Publicado: (2024)

Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree
por: Dong Yeap Kang, et al.
Publicado: (2024)

New lower bounds on the non-repetitive chromatic number of some graphs
por: Tao, Tianyi, et al.
Publicado: (2025)

On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs
por: Kamyczura, Mateusz, et al.
Publicado: (2024)

Positive codegree thresholds for perfect matchings in hypergraphs
por: Mycroft, Richard, et al.
Publicado: (2025)

Conflict-free chromatic index of bipartite graphs
por: Jin, Yuxin, et al.
Publicado: (2026)

The strong chromatic index of 1-planar graphs
por: Wang, Yiqiao, et al.
Publicado: (2022)

On the largest chromatic number of $F$-free hypergraphs
por: Wang, Yichen, et al.
Publicado: (2026)

Ramsey lower bounds for bounded degree hypergraphs
por: Fan, Chunchao, et al.
Publicado: (2026)

A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree
por: Wang, Yichen, et al.
Publicado: (2024)

On asymptotically tight bounds for the open conflict-free chromatic indexes of nearly regular graphs
por: Kamyczura, Mateusz, et al.
Publicado: (2026)

Conflict-free chromatic index of trees
por: Guo, Shanshan, et al.
Publicado: (2024)

Domination, matching and transversal numbers for Berge-$G$ hypergraphs
por: de Diego, María José Chávez, et al.
Publicado: (2025)

Bounded degree graphs and hypergraphs with no full rainbow matchings
por: Wdowinski, Ronen
Publicado: (2024)

A note on colour-bias perfect matchings in hypergraphs
por: Balogh, József, et al.
Publicado: (2024)

New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs
por: Kang, Dong Yeap, et al.
Publicado: (2020)