
The authors present a simple result on coloring hypergraphs and use it to obtain bounds on the chromatic number of graphs which do not induce certain trees. Several open problems are discussed.
Coloring of graphs and hypergraphs, hypergraphs, chromatic number, open problems, Discrete Mathematics and Combinatorics, trees, Hypergraphs, coloring, Trees, Theoretical Computer Science
Coloring of graphs and hypergraphs, hypergraphs, chromatic number, open problems, Discrete Mathematics and Combinatorics, trees, Hypergraphs, coloring, Trees, Theoretical Computer Science
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 18 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
