论文信息 - Ramsey graphs contain many distinct induced subgraphs

Ramsey graphs contain many distinct induced subgraphs

AbstractIt is shown that any graph onn vertices containing no clique and no independent set ont + 1 vertices has at least $$2^{{n \mathord{\left/ {\vphantom {n {(2t^{20 \log (2t)} )}}} \right. \kern-\nulldelimiterspace} {(2t^{20 \log (2t)} )}}} $$ distinct induced subgraphs.

Noga Alon | András Hajnal | N. Alon | A. Hajnal

[1] Paul Erdös,et al. On the number of distinct induced subgraphs of a graph , 1989, Discret. Math..

[2] P. Erdös. Some remarks on the theory of graphs , 1947 .

[3] Noga Alon,et al. Graphs with a small number of distinct induced subgraphs , 1989, Discret. Math..

[4] J. Spencer. Ramsey Theory , 1990 .

[5] Paul Erdös,et al. Ramsey-type theorems , 1989, Discret. Appl. Math..

[6] Noga Alon. Ramsey graphs cannot be defined by real polynomials , 1990, J. Graph Theory.