Pages that link to "Item:Q5847742"
From MaRDI portal
The following pages link to Combinatorial Relations and Chromatic Graphs (Q5847742):
Displayed 50 items.
- Three color Ramsey number of \(K_ 4-e\) (Q804597) (← links)
- A new construction technique of a triangle-free 3-colored K16's (Q881858) (← links)
- Lower bounds for bi-colored quaternary Ramsey numbers (Q912866) (← links)
- Triangles in a complete chromatic graph with three colors (Q1068844) (← links)
- The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\) (Q1078198) (← links)
- Ramsey numbers for local colorings (Q1090339) (← links)
- Ramsey numbers based on \(C_ 5\)-decompositions (Q1106242) (← links)
- Ramsey numbers for matchings (Q1143415) (← links)
- On the number of complete subgraphs contained in certain graphs (Q1159691) (← links)
- On group partitions associated with lower bounds for symmetric Ramsey numbers (Q1164067) (← links)
- Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields (Q1167174) (← links)
- On the Ramsey numbers R(3,8) and R(3,9) (Q1170201) (← links)
- On finite Ramsey numbers (Q1173103) (← links)
- On finite \(\Delta\)-systems (Q1211046) (← links)
- Difference sets and sum-free sets in groups of order 16 (Q1220075) (← links)
- Ramsey graphs and block designs (Q1224586) (← links)
- Generalized Ramsey theory for multiple colors (Q1227014) (← links)
- Ramsey numbers for quadrangles and triangles (Q1230796) (← links)
- A generalization of Ramsey theory for graphs (Q1245237) (← links)
- Split and balanced colorings of complete graphs (Q1301634) (← links)
- The third Ramsey numbers for graphs with at most four edges (Q1322298) (← links)
- Weakly representable but not representable relation algebras (Q1337158) (← links)
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\) (Q1343782) (← links)
- On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors (Q1356712) (← links)
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Q1377625) (← links)
- Notes on the Ramsey number N(3,3,3,3) (Q1393407) (← links)
- 3-colorability and forbidden subgraphs. I: Characterizing pairs (Q1422435) (← links)
- Difference Ramsey numbers and Issai numbers (Q1585507) (← links)
- New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14) (Q1808443) (← links)
- Ramsey numbers in complete balanced multipartite graphs. I: Set numbers (Q1827767) (← links)
- Some applications of graph theory to finite groups (Q1836678) (← links)
- Some geometrical aspects of a maximal three-coloured triangle-free graph (Q1838492) (← links)
- On Ramsey numbers for circuits (Q1844244) (← links)
- Generalised Ramsey numbers for small graphs (Q1845738) (← links)
- Path Ramsey numbers in multicolorings (Q1845890) (← links)
- Group Ramsey theory (Q1846429) (← links)
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
- An improved upper bound for Ramsey number \(R(3,3,3,3;2)\) (Q1893181) (← links)
- Bases for permutation groups and matroids (Q1902960) (← links)
- Representations for small relation algebras (Q1903131) (← links)
- Characterization of Laborde-Mulder graphs (extended odd graphs) (Q1916118) (← links)
- The smallest size of a complete cap in PG(3,\,7) (Q2497464) (← links)
- New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\) (Q2502037) (← links)
- The line analog of Ramsey numbers (Q2524793) (← links)
- Another analog of Ramsey numbers (Q2535847) (← links)
- Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes (Q2540894) (← links)
- Algebraic structure of chromatic graphs associated with the Ramsey number N(3,3,3; 2) (Q2546512) (← links)
- An upper bound for the Ramsey number M(5,4) (Q2548609) (← links)
- On Ramsey numbers and \(K_ r\)-coloring of graphs (Q2550031) (← links)
- Sur un problème de Erdős et Hajnal (Q2552142) (← links)