A note on regular Ramsey graphs

15 years 3 months ago

Download www.math.tau.ac.il

We prove that there is an absolute constant C > 0 so that for every natural n there exists a trianglefree regular graph with no independent set of size at least C n log n.

Noga Alon, Sonny Ben-Shimon, Michael Krivelevich

Real-time Traffic

CORR 2008 | Education | Independent Set | Natural | Trianglefree Regular Graph |

claim paper

» A Note on the Testability of Ramseys Class

» A Note on Odd CycleComplete Graph Ramsey Numbers

» RamseyType Problem for an Almost Monochromatic K4

» Note on Decomposition of Kn n into 0 jprisms

» A Note on Approximating MAXBISECTION on Regular Graphs

» Properly EdgeColoured Subgraphs in Colourings of Bounded Degree

» A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs

» Multiple Kronecker covering graphs

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Noga Alon, Sonny Ben-Shimon, Michael Krivelevich

Comments (0)

Sciweavers

A note on regular Ramsey graphs

CORR 2008 | Education | Independent Set | Natural | Trianglefree Regular Graph |

Explore & Download

Productivity Tools

Sciweavers