Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Theorem 3 (p. 2, quoted). "For all r≥2r\geq2 and d≥1d\geq1 there is a triangle-free dd-degenerate rr-uniform hypergraph with chromatic number d+1d+1."

Here a hypergraph is dd-degenerate when every subhypergraph has a vertex lying in at most dd of its edges, and a triangle in an rr-uniform hypergraph is three edges whose union is a set of r+1r+1 vertices (p. 1, abstract and footnote 1; p. 2); the full conventions are on the Lemma 4 page. The paper presents the theorem as showing that the greedy bound χ≤d+1\chi\leq d+1 for dd-degenerate hypergraphs is tight for every rr, ruling out for r≥3r\geq3 the o(d)o(d) and O(d1/(r−1))O(d^{1/(r-1)}) bounds that its background Theorems 1 and 2 might suggest (p. 2).

Source. David R. Wood, Hypergraph Colouring and Degeneracy, arXiv:1310.2972v3, as identified on the source card: Theorem 3 on p. 2.

Read depth. Claims checked: the statement was read clause by clause on the print. Nothing here is independently reviewed.

Proof pointer

p. 2: the paper states Theorem 3 as a corollary of Lemma 4, whose hypergraph GdG_d has the three properties; the lemma's extra conclusion on the sizes of colour classes is not needed.

Consequence for Problem 1022

This application is the corpus's; the paper does not mention the problem. Fix t≥2t\geq2 and take r=tr=t, d=2d=2. The theorem gives a finite tt-uniform hypergraph GG with χ(G)=3\chi(G)=3, so GG does not have property B.

Let XX be any nonempty set. The edges of GG inside XX are the edges of the induced subhypergraph G[Y]G[Y], Y=X∩V(G)Y=X\cap V(G). If YY is empty there are none. Otherwise G[Y]G[Y] is a subhypergraph, and so is every induced subhypergraph of it, so its vertices can be deleted one at a time, each lying in at most two remaining edges when deleted. Charge each edge to its first deleted vertex: each vertex is charged at most two edges, and the last vertex none, since every edge has t≥2t\geq2 vertices. Hence the number of edges inside XX is at most 2(∣Y∣−1)<2∣X∣2(|Y|-1)<2|X|.

So GG meets the hypothesis of the corrected statement (every nonempty XX) with every c≥2c\geq2 yet has no property B. Any constant cc for which that implication holds at a given t≥2t\geq2 therefore satisfies c<2c<2, and no sequence of such constants tends to infinity.

Bears on

  • Problem 1022: by the consequence above, every constant for which the implication of the corrected statement (nonempty XX) holds is below 22 at every t≥2t\geq2, so the corrected statement has the answer no.