Pages that link to "Item:Q4265586"
From MaRDI portal
The following pages link to Computation of the Folkman numberFe(3, 3; 5) (Q4265586):
Displaying 19 items.
- Some recent results on Ramsey-type numbers (Q385143) (← links)
- An exponential-type upper bound for Folkman numbers (Q681604) (← links)
- On the triangle vertex Folkman numbers (Q1408894) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- \(p\)-arrangeable graphs are Folkman linear (Q2025193) (← links)
- Chromatic vertex Folkman numbers (Q2195230) (← links)
- A note on upper bounds for some generalized Folkman numbers (Q2312073) (← 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)
- On the Folkman Number<i>f</i>(2, 3, 4) (Q3546252) (← links)
- An upper bound for the Folkman number <i>F</i>(3, 3; 5) (Q4285589) (← links)
- Small graphs with chromatic number 5: A computer search (Q4320470) (← links)
- Small minimal $(3, 3)$-Ramsey graphs (Q4994194) (← links)
- Lower bounding the Folkman numbers $F_v(a_1, ..., a_s; m - 1)$ (Q4994199) (← links)
- (Q5026974) (← links)
- On Some Open Questions for Ramsey and Folkman Numbers (Q5506775) (← links)
- On some generalized vertex Folkman numbers (Q6115430) (← links)
