Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference88 articles.
1. M. Ajtai, J. Komlós andE. Szemerédi, On infinite Sidon sequences,European J. Comb., to appear.
2. K. Appel andW. Haken, Every planar map is four colourable,Illinois J. of Math. 21 (1977) 429–490.
3. F. A. Behrend, On sets of integers which contain no three terms in arithmetic progression,Proc. Nat. Acad. Sci. USA 32 (1946) 331–332.
4. C. Berge,Graphs and Hypergraphs, North Holland Publ. Comp. Amsterdam—London 1973.
5. B. Bollobás,Extremal Graph Theory, London Math. Soc. Mon. No. 11. 1978.
Cited by
208 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A note on the Berge–Meyniel conjecture;Discrete Mathematics, Algorithms and Applications;2024-08-21
2. Perfect Matchings in Random Sparsifications of Dirac Hypergraphs;Combinatorica;2024-08-05
3. The inertia bound is far from tight;Bulletin of the London Mathematical Society;2024-07-30
4. On the harmonious chromatic number of graphs;Boletín de la Sociedad Matemática Mexicana;2024-06-02
5. The hitting time of clique factors;Random Structures & Algorithms;2024-03-28