On graphs with small subgraphs of large chromatic number-Reference-Cited by-同舟云学术

On graphs with small subgraphs of large chromatic number

Published:1985-12 Issue:1 Volume:1 Page:91-96
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Rödl V.,Duke R. A.

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02582932.pdf

Reference3 articles.

1. Bollobás, B., Erdös, P., Simonovits, M., Szemerédi, E.: Extremal graphs without large forbidden subgraphs. In: Advances in Graph Theory (Cambridge Comb. Conf. Trinity College, 1977). Ann. Discrete Math.3, 29–41 (1978)

2. Erdös, P.: Problems and results of graphs and hypergraphs: similarities and differences. In: Recent Progress in Ramsey Theory, edited by Nešetřil, J., Rödl, V. (Proc. Third Czechoslovak Symposium on Graph Theory, Prague 1982)

3. Szemerédi, E.: Regular partitions of graphs. Proc. Colloq. Int. C.N.R.S., pp. 399–401 (1976)

Cited by 45 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Testing versus estimation of graph properties, revisited;Random Structures & Algorithms;2024-04-26

2. Testing Graph Properties with the Container Method;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Hypergraph regularity and random sampling;Random Structures & Algorithms;2023-03

4. A Lower Bound on Cycle-Finding in Sparse Digraphs;ACM Transactions on Algorithms;2022-10-10

5. On the size-Ramsey number of grid graphs;Combinatorics, Probability and Computing;2021-04-06