N(4, 4; 3)≥13

DOI10.1016/S0021-9800(69)80123-7zbMath0322.05006MaRDI QIDQ4083433

John R. Isbell

Publication date: 1969

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05)

Related Items (7)

Lower bounds for bi-colored quaternary Ramsey numbers ⋮ Lower bounds for some Ramsey numbers ⋮ Ramsey numbers for triples ⋮ Sur les R-coloriages minimaux ⋮ A class of Ramsey-extremal hypergraphs ⋮ Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems) ⋮ \(N(5,4;3)\geq 24\)

This page was built for publication: N(4, 4; 3)≥13