Computation of the Folkman numberFe(3, 3; 5)
From MaRDI portal
Publication:4265586
DOI<41::AID-JGT4>3.0.CO;2-P 10.1002/(SICI)1097-0118(199909)32:1<41::AID-JGT4>3.0.CO;2-PzbMath0935.05041OpenAlexW2616256309MaRDI QIDQ4265586
Sebastian Urbański, Konrad Piwakowski, Stanislaw P. Radziszowski
Publication date: 26 April 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199909)32:1<41::aid-jgt4>3.0.co;2-p
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A Folkman Linear Family, Small minimal $(3, 3)$-Ramsey graphs, Lower bounding the Folkman numbers $F_v(a_1, ..., a_s; m - 1)$, Some recent results on Ramsey-type numbers, Finding Folkman Numbers via MAX CUT Problem, On some generalized vertex Folkman numbers, Chromatic vertex Folkman numbers, On the triangle vertex Folkman numbers, Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures, Unnamed Item, An exponential-type upper bound for Folkman numbers, \(p\)-arrangeable graphs are Folkman linear, A note on upper bounds for some generalized Folkman numbers, On Some Open Questions for Ramsey and Folkman Numbers, Computers and discovery in algebraic graph theory, On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
Cites Work
