×

Color critical hypergraphs and forbidden configurations. (English) Zbl 1192.05105

Felsner, Stefan (ed.), 2005 European conference on combinatorics, graph theory and applications (EuroComb ’05). Extended abstracts from the conference, Technische Universität Berlin, Berlin, Germany, September 5–9, 2005. Paris: Maison de l’Informatique et des Mathématiques Discrètes (MIMD). Discrete Mathematics & Theoretical Computer Science. Proceedings. AE, 117-122, electronic only (2005).
Summary: The present paper connects sharpenings of Sauer’s bound on forbidden configurations with color critical hypergraphs. We define a matrix to be simple if it is a \((0,1)\)-matrix with no repeated columns. Let \(F\) be a \(k\times l (0,1)\)-matrix (the forbidden configuration). Assume \(A\) is an \(m\times n\) simple matrix which has no submatrix which is a row and column permutation of \(F\). We define forb \((m,F)\) as the best possible upper bound on n, for such a matrix \(A\), which depends on m and \(F\). It is known that forb \((m,F)=O(m^{k})\) for any \(F\), and Sauer’s bond states that forb \((m,F)=O(m^{k-1})\) fore simple \(F\). We give sufficient condition for non-simple \(F\) to have the same bound using linear algebra methods to prove a generalization of a result of Lovász on color critical hypergraphs.
For the entire collection see [Zbl 1088.05001].

MSC:

05C65 Hypergraphs
05C15 Coloring of graphs and hypergraphs
05C35 Extremal problems in graph theory
PDFBibTeX XMLCite
Full Text: Link