Hypergraphs with zero chromatic threshold
From MaRDI portal
Publication:2631069
DOI10.1007/s00373-015-1667-6zbMath1342.05093arXiv1307.7363OpenAlexW2115072494MaRDI QIDQ2631069
Publication date: 28 July 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.7363
Related Items (1)
Cites Work
- On the structure of triangle-free graphs of large minimum degree
- On a Ramsey-Turán type problem
- On the chromatic number of triangle-free graphs of large minimum degree
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- The chromatic thresholds of graphs
- On the Ramsey-Turán numbers of graphs and hypergraphs
- On the chromatic number of pentagon-free graphs of large minimum degree
- On a valence problem in extremal graph theory
- Some exact Ramsey-Turán numbers
- Dense graphs with small clique number
- On the Chromatic Thresholds of Hypergraphs
This page was built for publication: Hypergraphs with zero chromatic threshold