Timeline for Maximum size of a graph with given girth
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 5, 2023 at 15:40 | comment | added | vidyarthi | @InuyashaYagami From here, theorem 4.1 and its corollary, we have that the maximum number of edges for a graph with order $n$ and even girth $2k$ is less than $\frac{n+n^{1+\frac1{k}}}{2}$. Note, however that when we take the complete graph, which has girth $3$, this bound fails | |
| Jul 5, 2023 at 13:49 | comment | added | Inuyasha Yagami | Could you please tell what is bound for even girth? It should be easily extended for odd girth. | |
| Jul 5, 2023 at 10:21 | history | asked | vidyarthi | CC BY-SA 4.0 |