Edge distribution and density in the characteristic sequence

The characteristic sequence of hypergraphs Pn : n < associated to a formula (x; y), introduced in [5], is defined by Pn(y1, . . . yn) = (x) in (x; yi). We continue the study of characteristic sequences, showing that graph-theoretic techniques, notably Szemer

• Type: Journal
• Year: 2010
• Where: APAL
• Authors: M. E. Malliaris
• Keywords: APAL 2010, Characteristic Sequence, Graph-theoretic Techniques, Regularity Lemma