Pages that link to "Item:Q5589119"
From MaRDI portal
The following pages link to Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring (Q5589119):
Displaying 50 items.
- Some recent results on Ramsey-type numbers (Q385143) (← links)
- On globally sparse Ramsey graphs (Q393934) (← links)
- Some remarks on vertex Folkman numbers for hypergraphs (Q449143) (← links)
- Splittings and Ramsey properties of permutation classes (Q477770) (← links)
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number (Q539861) (← links)
- On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers (Q653983) (← links)
- An exponential-type upper bound for Folkman numbers (Q681604) (← links)
- Sparse Ramsey graphs (Q795843) (← links)
- A multiplicative inequality for vertex Folkman numbers (Q941354) (← links)
- On multicolour noncomplete Ramsey graphs of star graphs (Q947133) (← links)
- An almost quadratic bound on vertex Folkman numbers (Q965241) (← links)
- Coloring of universal graphs (Q1073812) (← links)
- Partition properties of q-hypergraphs (Q1076044) (← links)
- Large triangle-free subgraphs in graphs without \(K_ 4\) (Q1078195) (← links)
- Three hundred million points suffice (Q1122573) (← links)
- Partition theorems for parameter systems and graphs (Q1153166) (← links)
- Simple proof of the existence of restricted Ramsey graphs by means of a partite construction (Q1167185) (← links)
- Ramsey-type properties of relational structures (Q1182733) (← links)
- Graph properties and hypergraph colourings (Q1184854) (← links)
- Generalized local colorings of graphs (Q1193560) (← links)
- On Ramsey graphs without bipartite subgraphs (Q1197030) (← links)
- Restricted Ramsey configurations (Q1221114) (← links)
- The Ramsey property for graphs with forbidden complete subgraphs (Q1227013) (← links)
- Partitions of finite relational and set systems (Q1239324) (← links)
- A Ramsey type problem concerning vertex colourings (Q1262327) (← links)
- A consistent edge partition theorem for infinite graphs (Q1332974) (← links)
- A note on restricted vertex Ramsey numbers (Q1375624) (← links)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- On the triangle vertex Folkman numbers (Q1408894) (← links)
- Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\) (Q1658778) (← links)
- On the nonexistence of some generalized Folkman numbers (Q1756051) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- Two proofs of the Ramsey property of the class of finite hypergraphs (Q1835932) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- \(p\)-arrangeable graphs are Folkman linear (Q2025193) (← links)
- Chromatic vertex Folkman numbers (Q2195230) (← links)
- Degree bipartite Ramsey numbers (Q2233618) (← links)
- The chromatic number of infinite graphs - A survey (Q2275377) (← links)
- A note on upper bounds for some generalized Folkman numbers (Q2312073) (← links)
- Degree Ramsey numbers for even cycles (Q2411600) (← links)
- On some edge Folkman numbers, small and large (Q2424295) (← links)
- On Ramsey numbers and \(K_ r\)-coloring of graphs (Q2550031) (← links)
- On a bound of Graham and Spencer for a graph-colouring constant (Q2555862) (← links)
- Degree Ramsey Numbers of Graphs (Q2883865) (← links)
- On induced Folkman numbers (Q2904596) (← links)
- Asymmetric Ramsey properties of random graphs involving cliques (Q3055757) (← links)
- On Ramsey-type positional games (Q3057062) (← links)
- On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$ (Q3300687) (← links)
- A Folkman Linear Family (Q3449860) (← links)
- Finding Folkman Numbers via MAX CUT Problem (Q3503536) (← links)
