A note on triangle-free graphs

Details A note on triangle-free graphs A note on triangle-free graphs

2011-01-17

arxiv.org/abs/1101.3188v1

Computer Science

Discrete Mathematics

4 pages, no figures

Scientific paper

We show that if $G$ is a simple triangle-free graph with $n\geq 3$ vertices,
without a perfect matching, and having a minimum degree at least
$\frac{n-1}{2}$, then $G$ is isomorphic either to $C_5$ or to
$K_{\frac{n-1}{2},\frac{n+1}{2}}$.

Affiliated with

Also associated with

No associations

Rating

A note on triangle-free graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on triangle-free graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on triangle-free graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-285732