On a probabilistic graph-theoretical method-Reference-Cited by-同舟云学术

On a probabilistic graph-theoretical method

Published:1978 Issue:2 Volume:72 Page:417-421
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Nešetřil Jaroslav,Rödl Vojtěch

Abstract

We introduce a method by means of which one can simply prove the existence of sparse hypergraphs with large chromatic number. Moreover this method gives the full solution of an Erdös-Ore problem.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/1978-072-02/S0002-9939-1978-0507350-7/S0002-9939-1978-0507350-7.pdf

Reference11 articles.

1. Graph theory and probability;Erdős, P.;Canadian J. Math.,1959

2. On chromatic number of graphs and set-systems;Erdős, P.;Acta Math. Acad. Sci. Hungar.,1966

3. Probability and Mathematical Statistics, Vol. 17;Erdős, Paul,1974

4. Some unsolved problems in graph theory and combinatorial analysis;Erdős, P.,1971

5. On chromatic number of finite set-systems;Lovász, L.;Acta Math. Acad. Sci. Hungar.,1968

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

1. Twin-width IV: ordered graphs and matrices;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

2. Generalized Turán problems for even cycles;Journal of Combinatorial Theory, Series B;2020-11

3. On subgraphs of C2k-free graphs and a problem of Kühn and Osthus;Combinatorics, Probability and Computing;2020-02-04

4. The Ramsey and the Ordering Property for Classes of Lattices and Semilattices;Order;2018-10-26

5. A Ramsey class for Steiner systems;Journal of Combinatorial Theory, Series A;2018-02