Combinatorial Relations and Chromatic Graphs
From MaRDI portal
Publication:5847742
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
Cited in
(only showing first 100 items - show all)- On edge-ordered Ramsey numbers
- Sur un problème de Erdős et Hajnal
- An upper bound for the Ramsey number M(5,4)
- An improved upper bound for Ramsey number R(3,3,3,3;2)
- New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)
- Lower bounds for bi-colored quaternary Ramsey numbers
- An adaptive upper bound on the Ramsey numbers \(R(3,\dots,3)\)
- Formalizing finite Ramsey theory in Lean 4
- Weakly representable but not representable relation algebras
- Partitioning graphs into complete and empty graphs
- The Ramsey number \(R_4 (3)\) is not solvable by group partition means
- The smallest size of a complete cap in PG(3,\,7)
- Some unsymmetric combinatorial numbers
- Ramsey numbers for quadrangles and triangles
- A survey of bounds for classical Ramsey numbers
- Gallai–Ramsey number for K5 ${K}_{5}$
- Multicolor star-critical Ramsey numbers and Ramsey-good graphs
- The line analog of Ramsey numbers
- Another analog of Ramsey numbers
- On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors
- Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph
- Generalised Ramsey numbers for small graphs
- The pigeonhole principle and multicolor Ramsey numbers
- The irredundant ramsey number s(3,3,3) = 13
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
- A threading path to a Ramsey number
- The rational number game
- Three color Ramsey number of \(K_ 4-e\)
- R(4, 5) = 25
- A generalization of Ramsey theory for graphs
- The Ramsey number N(3,3,3,3;2)
- The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\)
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor
- Some geometrical aspects of a maximal three-coloured triangle-free graph
- On Ramsey numbers for circuits
- 3-color Schur numbers
- Ramsey graphs and block designs
- Idiosynchromatic poetry
- On the number of complete subgraphs contained in certain graphs
- Extremal problems and results related to Gallai-colorings
- Difference Ramsey numbers and Issai numbers
- Triangular Ramsey numbers
- Nonfinite axiomatizability results for cylindric and relation algebras
- The Erdős-Hajnal conjecture for three colors and triangles
- 3-colored Ramsey numbers of odd cycles
- Lower bounds for Ramsey numbers as a statistical physics problem
- On the Ramsey numbers N(3,3,\dots ,3;2)
- Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues
- Canonical varieties with no canonical axiomatisation
- Partition relations for cardinal numbers
- Nonfinitizability of classes of representable cylindric algebras
- scientific article; zbMATH DE number 3237884 (Why is no real title available?)
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete.
- The third Ramsey numbers for graphs with at most four edges
- On the vertex Folkman numbers \(F_v(\underbrace{2,\dots,2}_R;R-1)\) and \(F_v(\underbrace{2,\dots,2}_R;R-2)\)
- Group Ramsey theory
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- Independent protection in graphs
- scientific article; zbMATH DE number 5722310 (Why is no real title available?)
- Strictly monotonic multidimensional sequences and stable sets in pillage games
- Equality of ordinary and symbolic powers of Stanley-Reisner ideals
- The coset and stability rings
- 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 numbers by stochastic algorithms with new heuristics
- Combinatorial properties of Farey graphs
- Signed Ramsey numbers
- Ramsey numbers based on \(C_ 5\)-decompositions
- Ramsey's theorem and self-complementary graphs
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- On the Ramsey numbers for stars versus complete graphs
- On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
- Representations for small relation algebras
- Split and balanced colorings of complete graphs
- Monochromatic triangles in three colours
- On the Ramsey numbers R(3,8) and R(3,9)
- On the Ramsey multiplicities of graphs—problems and recent results
- 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
- 3-colorability and forbidden subgraphs. I: Characterizing pairs
- An efficient container lemma
- 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
- 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
- New lower bounds for seven classical Ramsey numbers \(R(3,q)\)
- Poonen's conjecture and Ramsey numbers
- Some lower bounds of the Ramsey number \(n(k,k)\).
- On some open questions for Ramsey and Folkman numbers
- Clique immersions in graphs of independence number two with certain forbidden subgraphs
- Generalized Ramsey theory for graphs. I: Diagonal numbers
- scientific article; zbMATH DE number 7068502 (Why is no real title available?)
- On Ramsey numbers and \(K_ r\)-coloring of graphs
- On a bound of Graham and Spencer for a graph-colouring constant
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)