Combinatorial Relations and Chromatic Graphs

DOI10.4153/CJM-1955-001-4zbMath0064.17901WikidataQ56001777 ScholiaQ56001777MaRDI QIDQ5847742

Andrew M. Gleason, Robert E. Greenwood

Publication date: 1955

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

topology

Related Items

The irredundant ramsey number s(3,3,3) = 13, Relation algebra reducts of cylindric algebras and an application to proof theory, R(4, 5) = 25, Unnamed Item, New lower bounds of some diagonal Ramsey numbers, A survey of bounds for classical Ramsey numbers, A tribute to Frank P. Ramsey, 1903–1930, Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph, Unnamed Item, Unnamed Item, Canonical varieties with no canonical axiomatisation, Some unsymmetric combinatorial numbers, Partition relations for cardinal numbers, Nonfinitizability of classes of representable cylindric algebras, Lower bounds for some Ramsey numbers, Three color Ramsey number of \(K_ 4-e\), A new construction technique of a triangle-free 3-colored K16's, Lower bounds for bi-colored quaternary Ramsey numbers, Triangles in a complete chromatic graph with three colors, The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\), Ramsey numbers for local colorings, Ramsey numbers based on \(C_ 5\)-decompositions, Ramsey numbers for matchings, On the number of complete subgraphs contained in certain graphs, On group partitions associated with lower bounds for symmetric Ramsey numbers, Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields, On the Ramsey numbers R(3,8) and R(3,9), On finite Ramsey numbers, On finite \(\Delta\)-systems, Difference sets and sum-free sets in groups of order 16, Ramsey graphs and block designs, Generalized Ramsey theory for multiple colors, Ramsey numbers for quadrangles and triangles, A generalization of Ramsey theory for graphs, Split and balanced colorings of complete graphs, The third Ramsey numbers for graphs with at most four edges, Weakly representable but not representable relation algebras, Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\), On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors, Complexity of equations valid in algebras of relations. I: Strong non-finitizability, Notes on the Ramsey number N(3,3,3,3), 3-colorability and forbidden subgraphs. I: Characterizing pairs, Difference Ramsey numbers and Issai numbers, New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14), Ramsey numbers in complete balanced multipartite graphs. I: Set numbers, Some applications of graph theory to finite groups, Some geometrical aspects of a maximal three-coloured triangle-free graph, On Ramsey numbers for circuits, Generalised Ramsey numbers for small graphs, Path Ramsey numbers in multicolorings, Group Ramsey theory, Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete., An improved upper bound for Ramsey number \(R(3,3,3,3;2)\), Bases for permutation groups and matroids, Representations for small relation algebras, Characterization of Laborde-Mulder graphs (extended odd graphs), The smallest size of a complete cap in PG(3,\,7), New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\), The line analog of Ramsey numbers, Another analog of Ramsey numbers, Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes, Algebraic structure of chromatic graphs associated with the Ramsey number N(3,3,3; 2), An upper bound for the Ramsey number M(5,4), On Ramsey numbers and \(K_ r\)-coloring of graphs, Sur un problème de Erdős et Hajnal, Some lower bounds of the Ramsey number \(n(k,k)\)., Ramsey's theorem and self-complementary graphs, On a bound of Graham and Spencer for a graph-colouring constant, The Ramsey number N(3,3,3,3;2), Generalized Ramsey theory for graphs. I: Diagonal numbers, On the Ramsey numbers N(3,3,\dots ,3;2), Unnamed Item, A class of self-complementary graphs and lower bounds of some ramsey numbers, Diagonal Ramsey numbers for small graphs, Monochromatic triangles in three colours, Ramsey numbers for graphs with five vertices, All triangle-graph ramsey numbers for connected graphs of order six, A note on constructive methods for ramsey numbers, On the Ramsey multiplicities of graphs—problems and recent results, Ramsey Graphs and Block Designs. I, Nonfinite axiomatizability results for cylindric and relation algebras