Pages that link to "Item:Q4745846"

The following pages link to A survey of bounds for classical Ramsey numbers (Q4745846):

Displaying 22 items.

• Regular languages viewed from a graph-theoretic perspective (Q515689) (← links)
• Edge-colored complete graphs with precisely colored subgraphs (Q787167) (← links)
• Three color Ramsey number of \(K_ 4-e\) (Q804597) (← links)
• Lower bounds for bi-colored quaternary Ramsey numbers (Q912866) (← links)
• Edge-colorings avoiding rainbow and monochromatic subgraphs (Q942100) (← links)
• A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
• Quantitative forms of a theorem of Hilbert (Q1065804) (← links)
• Some new computer generated results in Ramsey graph theory (Q1100484) (← links)
• Quantitative theorems for regular systems of equations (Q1108271) (← links)
• The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős (Q1428861) (← links)
• Some properties of Ramsey numbers (Q1433193) (← links)
• Difference Ramsey numbers and Issai numbers (Q1585507) (← links)
• A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
• Lower bounds for small diagonal Ramsey numbers (Q1820171) (← links)
• A note on upper bounds for some Ramsey numbers (Q1838979) (← links)
• Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory (Q2053552) (← links)
• On a diagonal conjecture for classical Ramsey numbers (Q2322886) (← links)
• Upper and lower Ramsey bounds in bounded arithmetic (Q2488271) (← links)
• A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (Q2980911) (← links)
• On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs (Q5096590) (← links)
• An adaptive upper bound on the Ramsey numbers $R(3,\dots,3)$ (Q5148735) (← links)
• On Some Open Questions for Ramsey and Folkman Numbers (Q5506775) (← links)