Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

JGT
2010

favoriteEmaildiscussreport

127views more JGT 2010»

On the minimum degree of minimal Ramsey graphs

13 years 9 months ago

On the minimum degree of minimal Ramsey graphs

Download people.inf.ethz.ch

We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter for numerous bipartite graphs, including bi-regular bipartite graphs and forests. We also make initial progress for graphs of larger chromatic number. Numerous interesting problems remain open.

Tibor Szabó, Philipp Zumstein, Stefanie Z&u

Real-time Traffic

Bipartite Graphs | JGT 2010 | Minimal Ramsey Graphs | Numerous Bipartite Graphs |

claim paper

Related Content

» Ends and Vertices of Small Degree in Infinite Minimally kEdgeConnected Graphs

» Unicyclic and bicyclic graphs having minimum degree distance

» Sequential and parallel triangulating algorithms for Elimination Game and new insights on ...

» On the minimal degree implying equality of the largest trianglefree and bipartite subgraph...

» Bounds on the Geometric Mean of Arc Lengths for BoundedDegree Planar Graphs

» A New Algorithm for Finding Minimal CycleBreaking Sets of Turns in a Graph

» Fixedparameter tractability results for fulldegree spanning tree and its dual

» On the Minimum Load Coloring Problem

» Vertex Cover in Graphs with Locally Few Colors

Post Info
More Details (n/a)

Added	28 Jan 2011
Updated	28 Jan 2011
Type	Journal
Year	2010
Where	JGT
Authors	Tibor Szabó, Philipp Zumstein, Stefanie Zürcher

Comments (0)