Timeline for Is there a characterization for graphs with independence number two?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 15, 2023 at 18:42 | comment | added | domotorp | @joro I don't understand what you mean. | |
| Oct 15, 2023 at 15:25 | comment | added | joro | One solution is (2,0)-colorable graphs. Their vertices can be partitioned in 2 cliques and they are complements of bipartite graphs. | |
| Oct 15, 2023 at 13:42 | comment | added | Tobias Fritz | A graph has independence number $\le 2$ if and only if its complement is triangle-free. Of course this is just a restatement of the definition, but this may still be a helpful keyword, and it may also indicate that a more nontrivial characterization doesn't exist. | |
| Oct 15, 2023 at 13:42 | comment | added | Richard Stanley | The complement of a graph with $\alpha(G)\leq 2$ is a triangle-free graph. There is no simple characterization. See en.wikipedia.org/wiki/Triangle-free_graph for some information. | |
| Oct 15, 2023 at 13:21 | history | edited | Licheng Zhang | CC BY-SA 4.0 |
added 2 characters in body
|
| Oct 15, 2023 at 13:13 | history | edited | Licheng Zhang | CC BY-SA 4.0 |
added 86 characters in body
|
| Oct 15, 2023 at 13:05 | history | asked | Licheng Zhang | CC BY-SA 4.0 |