Combinatorial Relations and Chromatic Graphs

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

Robert E. Greenwood, Andrew M. Gleason

Publication date: 1955

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

zbMATH Keywords

topology

Related Items (only showing first 100 items - show all)

The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\) ⋮ Weakly representable but not representable relation algebras ⋮ Ramsey numbers for local colorings ⋮ Poonen's conjecture and Ramsey numbers ⋮ Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\) ⋮ An improved upper bound for Ramsey number \(R(3,3,3,3;2)\) ⋮ On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors ⋮ Bases for permutation groups and matroids ⋮ Representations for small relation algebras ⋮ Ramsey numbers based on \(C_ 5\)-decompositions ⋮ Subcompletions of representable relation algebras ⋮ Unnamed Item ⋮ Shannon capacity and the categorical product ⋮ Characterization of Laborde-Mulder graphs (extended odd graphs) ⋮ The Schur degree of additive sets ⋮ Complexity of equations valid in algebras of relations. I: Strong non-finitizability ⋮ Generalized Paley graphs and their complete subgraphs of orders three and four ⋮ A new construction technique of a triangle-free 3-colored K16's ⋮ Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues ⋮ Notes on the Ramsey number N(3,3,3,3) ⋮ Independent protection in graphs ⋮ Strictly monotonic multidimensional sequences and stable sets in pillage games ⋮ 3-color Schur numbers ⋮ Ramsey numbers for matchings ⋮ The pigeonhole principle and multicolor Ramsey numbers ⋮ Lower bounds for bi-colored quaternary Ramsey numbers ⋮ On the number of complete subgraphs contained in certain graphs ⋮ Monochromatic triangles in three colours ⋮ On group partitions associated with lower bounds for symmetric Ramsey numbers ⋮ 3-colorability and forbidden subgraphs. I: Characterizing pairs ⋮ Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields ⋮ Monochromatic triangles in three-coloured graphs ⋮ On the Ramsey numbers R(3,8) and R(3,9) ⋮ On finite Ramsey numbers ⋮ Sum-free cyclic multi-bases and constructions of Ramsey algebras ⋮ A characterization of the prime graphs of solvable groups. ⋮ Extremal problems and results related to Gallai-colorings ⋮ Multicolour Ramsey numbers of odd cycles ⋮ Ramsey numbers for graphs with five vertices ⋮ Gallai-Ramsey numbers for monochromatic triangles or 4-cycles ⋮ Equality of ordinary and symbolic powers of Stanley-Reisner ideals ⋮ On finite \(\Delta\)-systems ⋮ Suitable sets of permutations, packings of triples, and Ramsey's theorem ⋮ Difference sets and sum-free sets in groups of order 16 ⋮ On the Ramsey numbers for stars versus complete graphs ⋮ On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs ⋮ Ramsey graphs and block designs ⋮ A class of self-complementary graphs and lower bounds of some ramsey numbers ⋮ Generalized Ramsey theory for multiple colors ⋮ The smallest size of a complete cap in PG(3,\,7) ⋮ Ramsey numbers for quadrangles and triangles ⋮ Clique immersions in graphs of independence number two with certain forbidden subgraphs ⋮ New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\) ⋮ Gallai-Ramsey numbers for multiple triangles ⋮ A generalization of Ramsey theory for graphs ⋮ Partitioning transitive tournaments into isomorphic digraphs ⋮ A note on Gallai-Ramsey number of even wheels ⋮ New lower bounds for seven classical Ramsey numbers \(R(3,q)\) ⋮ List-coloring claw-free graphs with small clique number ⋮ All triangle-graph ramsey numbers for connected graphs of order six ⋮ The line analog of Ramsey numbers ⋮ Representability of Ramsey relation algebras ⋮ New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14) ⋮ Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory ⋮ On edge‐ordered Ramsey numbers ⋮ A note on constructive methods for ramsey numbers ⋮ Another analog of Ramsey numbers ⋮ New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\) ⋮ On the Ramsey multiplicities of graphs—problems and recent results ⋮ Ramsey Graphs and Block Designs. I ⋮ 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 ⋮ Nonfinite axiomatizability results for cylindric and relation algebras ⋮ Ramsey numbers in complete balanced multipartite graphs. I: Set numbers ⋮ 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) ⋮ Diagonal Ramsey numbers for small graphs ⋮ Some applications of graph theory to finite groups ⋮ Some geometrical aspects of a maximal three-coloured triangle-free graph ⋮ Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor ⋮ Partitioning graphs into complete and empty graphs ⋮ On Ramsey numbers for circuits ⋮ Difference Ramsey numbers and Issai numbers ⋮ Generalised Ramsey numbers for small graphs ⋮ Path Ramsey numbers in multicolorings ⋮ Group Ramsey theory ⋮ Split and balanced colorings of complete graphs ⋮ Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. ⋮ Idiosynchromatic poetry ⋮ Three color Ramsey number of \(K_ 4-e\) ⋮ Triangles in a complete chromatic graph with three colors ⋮ The Erdős-Hajnal conjecture for three colors and triangles ⋮ The third Ramsey numbers for graphs with at most four edges

This page was built for publication: Combinatorial Relations and Chromatic Graphs