Timeline for Relationship between triangle free graphs and their minimum degree
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 19, 2013 at 22:27 | comment | added | The Masked Avenger | Thanks for accepting the answer. I would still like to know more of the motivation and the corollary, even if it did not turn out to be much more interesting. | |
| Jul 19, 2013 at 3:27 | vote | accept | Anand | ||
| Jul 17, 2013 at 9:17 | review | Close votes | |||
| Jul 17, 2013 at 11:36 | |||||
| Jul 17, 2013 at 5:32 | answer | added | The Masked Avenger | timeline score: 5 | |
| Jul 17, 2013 at 4:39 | answer | added | Aaron Meyerowitz | timeline score: 3 | |
| Jul 17, 2013 at 2:00 | answer | added | Igor Rivin | timeline score: 3 | |
| Jul 17, 2013 at 0:08 | comment | added | The Masked Avenger | It might be useful to consider two vertices of minimum degree joined by an edge. If the graph is triangle free that gets a bound close to what is suggested, but there is more lurking behind the example. | |
| Jul 16, 2013 at 23:25 | comment | added | Aaron Meyerowitz | You want an upper bound on the minimum degree. The average degree is larger (or at least as large.) Look for upper bounds on the number of edges in a triangle free graph with $n$ vertices (complete bipartite...) and use that. | |
| Jul 16, 2013 at 23:09 | review | First posts | |||
| Jul 16, 2013 at 23:18 | |||||
| Jul 16, 2013 at 22:51 | history | asked | Anand | CC BY-SA 3.0 |