An upper bound for the Ramsey number M(5,4)
From MaRDI portal
Publication:2548609
DOI10.1016/0097-3165(71)90002-1zbMath0225.05117MaRDI QIDQ2548609
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(71)90002-1
05C35: Extremal problems in graph theory
Related Items
Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey, On group partitions associated with lower bounds for symmetric Ramsey numbers, On finite Ramsey numbers, Subgraph counting identities and Ramsey numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A uniqueness theorem for edge-chromatic graphs
- On Sets of Acquaintances and Strangers at any Party
- Upper bounds for some Ramsey numbers
- Graph-Colouring and Combinatorial Numbers
- Some graph theoretic results associated with Ramsey's theorem
- Dichromatic graphs and Ramsey numbers
- Combinatorial Relations and Chromatic Graphs