The number of hypergraphs and colored Hypergraphs with hereditary properties
| dc.creator | Ishigami, Yoshiyasu | |
| dc.date | 2007-12-04 | |
| dc.date.accessioned | 2026-07-07T08:47:08Z | |
| dc.date.available | 2026-07-07T08:47:08Z | |
| dc.description | As an application of Szemeredi's regularity lemma, Erdos-Frankl-Rodl (1986) showed that the number of graphs on vertex set {1,2,...n} with a monotone class P is $2^{(1+o(1))ex(n,P)n^2/2}$ where $ex(n,P)$ is the maximum number of edges of an n-vertex graph which has no subgraph in P. Kohayakawa et al. (2003) extended it from monotone to hereditary and from graphs to 3-uniform hypergraphs. We extend it to general hypergraphs. This may be a simple example illustrating how to apply a recent hypergraph regularity lemma by the author. | |
| dc.description | 9 pages | |
| dc.identifier | https://arxiv.org/abs/0712.0425 | |
| dc.identifier | http://arxiv.org/abs/0712.0425 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/143495 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C65 | |
| dc.title | The number of hypergraphs and colored Hypergraphs with hereditary properties | |
| dc.type | text |