ViraScience.
Scholarly record

On the chromatic number of set systems

Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali

Abstract

An r l -system is an r-uniform hypergraph in which every set of l vertices lies in at most one edge. Let mk r l be the minimum number of edges in an r l -system that is not k-colorable. Using probabilistic techniques, we prove that ar l kr−1 ln k l/ l−1 ≤ mk r l ≤ br l kr−1 ln k l/ l−1 where br l is explicitly defined and ar l is sufficiently small. We also give a different argument proving (for even k) mk r l ≥ ar lk r−1 l/ l−1 where ar l = r − l + 1 /r 2r−1re −l/ l−1 . Our results complement earlier results of Erdős and Lovász [10] who mainly focused on the case l = 2 k fixed, and r large. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19, 87–98, 2001

Similar items

  • Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval

    Scholarly record1998Ars Comb.Jianzhuan Wu, Wensong Lin

    Suppose S is a subset of a metric spaceM with a metric δ, and D a subset of positive real numbers. The distance graph G(S, D), with a distance set D, is the graph with vertex set S in which two vertices x and y are adjacent iff δ(x, y) ∈ D. Distance graphs, first studied by Eggle

  • Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples

    Scholarly record2000Eur. J. Comb.Lingling Huang, Gerard J. Chang

    Given a set D of positive integers, the distance graph G(Z , D) has all integers as vertices, and two vertices are adjacent if and only if their difference is in D; that is, the vertex set is Z and the edge set is {uv : |u − v| ∈ D}. We call D the distance set. This paper studies

  • Chromatic number of graphs with special distance sets, I

    Scholarly record2014V. Yegnanarayanan

    Given a subset D of positive integers, an integer distance graph is a graphG(Z, D) with the set Z of integers as vertex set and with an edge joining two vertices u and v if and only if |u−v| ∈ D. In this paper we consider the problem of determining the chromatic number of certain

  • The set chromatic number of a graph

    Scholarly record2009Discussiones Mathematicae Graph TheoryGary Chartrand, Futaba Fujie-Okamoto, Craig W. Rasmussen, Ping Zhang

    For a nontrivial connected graph G, let c : V (G) → N be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) 6= N

  • On the set of circular total chromatic numbers of graphs

    Scholarly record2013Discrete MathematicsMohammad Ghebleh

    For every integer r > 3 and every ε > 0 we construct a graph with maximum degree r − 1 whose circular total chromatic number is in the interval (r, r + ε). This proves that (i) every integer r > 3 is an accumulation point of the set of circular total chromatic numbers of graphs,

  • A tight bound on the set chromatic number

    Scholarly record2013Discussiones Mathematicae Graph TheoryJean-Sébastien Sereni, Zelealem B. Yilma

    The purpose of this note is to provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Namely, for all graphs G, we show that χs(G) > dlog2 χ(G)e+ 1, where χs(G) and χ(G) are the set chromatic number and the chromatic number of G, respective