High girth hypergraphs with unavoidable monochromatic or rainbow edges

DOI10.7151/dmgt.2291OpenAlexW3003004133WikidataQ126309619 ScholiaQ126309619MaRDI QIDQ2118239

Annette Karrer, Maria A. Axenovich

Publication date: 22 March 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2291

zbMATH Keywords

rainbowhypergraphchromatic numbergirthmixed hypergraphselectivemonochromaticbihyper-graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring, sparseness and girth
• Selective hypergraph colourings
• A hypergraph-free construction of highly chromatic graphs without short cycles
• On colorings of graphs without short cycles
• Coloring mixed hypergraphs: theory, algorithms and applications
• Constraints, MMSNP and expander relational structures
• Constructions of sparse uniform hypergraphs with high chromatic number
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• Graph Theory and Probability
• Selective Graphs and Hypergraphs
• On a Probabilistic Graph-Theoretical Method
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Colourings of Uniform Hypergraphs with Large Girth and Applications
• Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
• A Combinatorial Classic — Sparse Graphs with High Chromatic Number
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• On the existence of regular n-graphs with given girth