On Ramsey numbers of uniform hypergraphs with given maximum degree
Authors:
- A.V. KostochkaAKA.V. Kostochka
- V. RödlVRV. Rödl
- 31 October 2006
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 113 (7) , 1555-1564
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On Graphs With Small Ramsey Numbers, IICombinatorica, 2004
- On Ramsey Numbers of Sparse GraphsCombinatorics, Probability and Computing, 2003
- On graphs with small Ramsey numbers*Journal of Graph Theory, 2001
- Subdivided graphs have linear ramsey numbersJournal of Graph Theory, 1994
- Graphs with Linearly Bounded Ramsey NumbersJournal of Combinatorial Theory, Series B, 1993
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponentGraphs and Combinatorics, 1986
- The Ramsey number of a graph with bounded maximum degreeJournal of Combinatorial Theory, Series B, 1983
- A note on the independence number of triangle-free graphsDiscrete Mathematics, 1983
- Asymptotic lower bounds for Ramsey functionsDiscrete Mathematics, 1977