Combinatorial Relations and Chromatic Graphs

DOI10.4153/CJM-1955-001-4zbMATH Open0064.17901WikidataQ56001777 ScholiaQ56001777MaRDI QIDQ5847742FDOQ5847742

Authors: Robert E. Greenwood, Andrew M. Gleason 

Publication date: 1955

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

Recommendations

• scientific article; zbMATH DE number 165092
• Complementary graphs and the chromatic number
• Chromatic graph theory
• Chromatic graph theory
• scientific article; zbMATH DE number 3245178
• Recursion relations for chromatic coefficients for graphs and hypergraphs
• Partition Relations Connected with the Chromatic Number of Graphs
• scientific article; zbMATH DE number 568845
• Topics in Chromatic Graph Theory
• Graph of realizations and chromatic numbers

zbMATH Keywords

topology

Cited In (only showing first 100 items - show all)

• The Erdős–Gyárfás function with respect to Gallai‐colorings
• Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues
• The third Ramsey numbers for graphs with at most four edges
• Independent protection in graphs
• Strictly monotonic multidimensional sequences and stable sets in pillage games
• Equality of ordinary and symbolic powers of Stanley-Reisner ideals
• Ramsey numbers for graphs with five vertices
• All triangle-graph ramsey numbers for connected graphs of order six
• Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
• Ramsey numbers in complete balanced multipartite graphs. I: Set numbers
• Ramsey's theorem and self-complementary graphs
• Ramsey numbers based on \(C_ 5\)-decompositions
• Complexity of equations valid in algebras of relations. I: Strong non-finitizability
• Representations for small relation algebras
• Monochromatic triangles in three colours
• On the Ramsey numbers for stars versus complete graphs
• On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
• Split and balanced colorings of complete graphs
• On the Ramsey multiplicities of graphs—problems and recent results
• On the Ramsey numbers R(3,8) and R(3,9)
• 3-colorability and forbidden subgraphs. I: Characterizing pairs
• Relation algebra reducts of cylindric algebras and an application to proof theory
• Subcompletions of representable relation algebras
• Some applications of graph theory to finite groups
• On finite \(\Delta\)-systems
• New lower bounds for seven classical Ramsey numbers \(R(3,q)\)
• Some lower bounds of the Ramsey number \(n(k,k)\).
• Poonen's conjecture and Ramsey numbers
• Generalized Ramsey theory for graphs. I: Diagonal numbers
• A tribute to Frank P. Ramsey, 1903–1930
• Path Ramsey numbers in multicolorings
• A class of self-complementary graphs and lower bounds of some ramsey numbers
• A new construction technique of a triangle-free 3-colored K16's
• Bases for permutation groups and matroids
• Characterization of Laborde-Mulder graphs (extended odd graphs)
• Monochromatic triangles in three-coloured graphs
• New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
• On group partitions associated with lower bounds for symmetric Ramsey numbers
• List-coloring claw-free graphs with small clique number
• Representability of Ramsey relation algebras
• Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
• New lower bounds of some diagonal Ramsey numbers
• Difference sets and sum-free sets in groups of order 16
• A note on constructive methods for ramsey numbers
• Ramsey numbers for local colorings
• A characterization of the prime graphs of solvable groups.
• New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14)
• Generalized Paley graphs and their complete subgraphs of orders three and four
• Generalized Ramsey theory for multiple colors
• Diagonal Ramsey numbers for small graphs
• Ramsey Graphs and Block Designs. I
• Title not available (Why is that?)
• Sum-free cyclic multi-bases and constructions of Ramsey algebras
• Triangles in a complete chromatic graph with three colors
• On finite Ramsey numbers
• An improved upper bound for Ramsey number \(R(3,3,3,3;2)\)
• Lower bounds for bi-colored quaternary Ramsey numbers
• An adaptive upper bound on the Ramsey numbers \(R(3,\dots,3)\)
• Partitioning graphs into complete and empty graphs
• The smallest size of a complete cap in PG(3,\,7)
• A survey of bounds for classical Ramsey numbers
• Ramsey numbers for quadrangles and triangles
• Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph
• Generalised Ramsey numbers for small graphs
• Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
• R(4, 5) = 25
• Three color Ramsey number of \(K_ 4-e\)
• A generalization of Ramsey theory for graphs
• The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\)
• Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor
• Ramsey graphs and block designs
• Nonfinite axiomatizability results for cylindric and relation algebras
• On the number of complete subgraphs contained in certain graphs
• 3-colored Ramsey numbers of odd cycles
• Difference Ramsey numbers and Issai numbers
• Canonical varieties with no canonical axiomatisation
• On the Ramsey numbers N(3,3,\dots ,3;2)
• Partition relations for cardinal numbers
• Nonfinitizability of classes of representable cylindric algebras
• On the vertex Folkman numbers \(F_v(\underbrace{2,\dots,2}_R;R-1)\) and \(F_v(\underbrace{2,\dots,2}_R;R-2)\)
• Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete.
• Title not available (Why is that?)
• Group Ramsey theory
• The coset and stability rings
• Ramsey numbers by stochastic algorithms with new heuristics
• Signed Ramsey numbers
• Combinatorial properties of Farey graphs
• An efficient container lemma
• Algebraic structure of chromatic graphs associated with the Ramsey number N(3,3,3; 2)
• Suitable sets of permutations, packings of triples, and Ramsey's theorem
• The down-arrow Ramsey set of a graph
• The Ramsey number for two graphs of order 5
• Gallai-Ramsey numbers for monochromatic triangles or 4-cycles
• Multicolour Ramsey numbers of odd cycles
• On some open questions for Ramsey and Folkman numbers
• Title not available (Why is that?)
• Clique immersions in graphs of independence number two with certain forbidden subgraphs
• On Ramsey numbers and \(K_ r\)-coloring of graphs
• On a bound of Graham and Spencer for a graph-colouring constant
• Lower bounds for some Ramsey numbers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5847742)