High girth hypergraphs with unavoidable monochromatic or rainbow edges

DOI10.7151/DMGT.2291OpenAlexW3003004133WikidataQ126309619 ScholiaQ126309619MaRDI QIDQ2118239FDOQ2118239

Annette Karrer, Maria 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

Recommendations

• Constructions of sparse uniform hypergraphs with high chromatic number
• Random constructions of hypergraphs with large girth and without panchromatic colorings
• scientific article; zbMATH DE number 3908477
• Coloring non-uniform hypergraphs without short cycles
• Coloring uniform hypergraphs with few edges

zbMATH Keywords

rainbowchromatic numbergirthhypergraphmixed hypergraphselectivemonochromaticbihyper-graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• High girth hypergraphs with unavoidable monochromatic or rainbow edges
• Title not available (Why is that?)

This page was built for publication: High girth hypergraphs with unavoidable monochromatic or rainbow edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118239)