Image de couverture de livre

The chromatic number of triangle-free hypergraphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Li, Lina, Postle, Luke
Format:	Preprint
Publié:	2022
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
par: Kelly, Tom, et autres
Publié: (2018)

Three-chromatic geometric hypergraphs
par: Damásdi, Gábor, et autres
Publié: (2021)

Conflict-free chromatic index of trees
par: Guo, Shanshan, et autres
Publié: (2024)

Linear versus centred chromatic numbers
par: Bose, Prosenjit, et autres
Publié: (2022)

Balanced-chromatic number and Hadwiger-like conjectures
par: Jiménez, Andrea, et autres
Publié: (2023)

On cuts of small chromatic number in sparse graphs
par: Aubian, Guillaume, et autres
Publié: (2025)

More results on the $z$-chromatic number of graphs
par: Khaleghi, Abbas, et autres
Publié: (2023)

The strong chromatic index of $K_{t,t}$-free graphs
par: Bi, Richard, et autres
Publié: (2026)

Bounding the chromatic number of dense digraphs by arc neighborhoods
par: Klingelhoefer, Felix, et autres
Publié: (2023)

A new vertex coloring heuristic and corresponding chromatic number
par: Zaker, Manouchehr
Publié: (2020)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
par: Das, Sandip, et autres
Publié: (2023)

An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
par: Char, Arnab, et autres
Publié: (2024)

Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs
par: Delcourt, Michelle, et autres
Publié: (2021)

An improvement on the bound for the acyclic chromatic index
par: Kirousis, Lefteris, et autres
Publié: (2026)

On arborescence packing augmentation in hypergraphs
par: Hoppenot, Pierre, et autres
Publié: (2024)

Packing chromatic critical graphs with radius at most 2
par: Gür, Aslıhan, et autres
Publié: (2026)

Burling graphs in graphs with large chromatic number
par: Abrishami, Tara, et autres
Publié: (2025)

On acyclic b-chromatic number of cubic graphs
par: Anholcer, Marcin, et autres
Publié: (2025)

Balanced colorings of Erdős-Rényi hypergraphs
par: Dhawan, Abhishek, et autres
Publié: (2025)

Balanced independent sets and colorings of hypergraphs
par: Dhawan, Abhishek
Publié: (2023)

A note on hypergraphs with asymmetric Ramsey properties
par: Sviridenkov, Vladimir
Publié: (2026)

Chemically inspired Erdős-Rényi oriented hypergraphs
par: Garcia-Chung, Angel, et autres
Publié: (2023)

The Avoider-Enforcer game on hypergraphs of rank 3
par: Galliot, Florian, et autres
Publié: (2025)

(Claw, C_3)-free digraphs with unbounded dichromatic number
par: Aubian, Guillaume, et autres
Publié: (2026)

Regular packing of rooted hyperforests with root constraints in hypergraphs
par: Hoppenot, Pierre, et autres
Publié: (2023)

Note on polychromatic coloring of hereditary hypergraph families II
par: Pálvölgyi, Dömötör
Publié: (2026)

Tree-independence number of $P_5$-free graphs with no large bicliques
par: Blažej, Václav, et autres
Publié: (2026)

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
par: Galliot, Florian, et autres
Publié: (2022)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
par: Pilipczuk, Marcin, et autres
Publié: (2023)

The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem
par: Martínez-Sandoval, Leonardo, et autres
Publié: (2019)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
par: Nakajima, Tamio-Vesa, et autres
Publié: (2025)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
par: Meunier, Anthony, et autres
Publié: (2026)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
par: Bencs, Ferenc, et autres
Publié: (2025)

Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
par: Aboulker, Pierre, et autres
Publié: (2024)

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
par: Hoppenot, Pierre, et autres
Publié: (2024)

EPPA numbers of graphs
par: Bradley-Williams, David, et autres
Publié: (2023)

Cop numbers of periodic graphs
par: De Carufel, Jean-Lou, et autres
Publié: (2023)

C sequential optimization numbers
par: Hui, Zile
Publié: (2024)

Computing the clique number of tournaments
par: Aubian, Guillaume
Publié: (2024)

On the inversion number of oriented graphs
par: Bang-Jensen, Jørgen, et autres
Publié: (2021)