Timeline for Maximal graphs with a property that is invariant w.r.t. vertex removal
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 10, 2023 at 5:28 | comment | added | Fedor Petrov | Such properties are called "hereditary", and this inequality is one of the standard proofs of Turan theorem (on graphs without $K_r$). So I would search for key words "hereditary graph property" and "Turan theorem" | |
| Mar 10, 2023 at 1:53 | comment | added | Brendan McKay | Lots of papers use "size" for the number of vertices. Although the number of edges is the "standard" definition, this is abused so often that one can't really be sure without checking. | |
| Mar 10, 2023 at 0:08 | answer | added | Brendan McKay | timeline score: 1 | |
| Feb 3, 2023 at 1:17 | comment | added | RobPratt | Order is number of vertices, and size is number of edges. | |
| Feb 3, 2023 at 0:50 | comment | added | LSpice | What is the size of a graph? The number of its vertices? | |
| Feb 3, 2023 at 0:50 | history | edited | LSpice | CC BY-SA 4.0 |
Capitalise title
|
| Feb 2, 2023 at 22:02 | history | asked | Max Alekseyev | CC BY-SA 4.0 |