Timeline for How can one construct a class of $k$-connected $k$-regular bipartite graphs with the girth of (at most) $k-1$?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 12, 2023 at 1:49 | vote | accept | Licheng Zhang | ||
| Jul 11, 2023 at 6:36 | answer | added | Gordon Royle | timeline score: 3 | |
| Jul 11, 2023 at 1:55 | comment | added | Licheng Zhang | @GordonRoyle Nice! By the way, can the connectivity of the circulant graph be guaranteed (assuming other conditions are well verified)? Perhaps there are some reference that can be seen. I have a feeling that all desired graphs can also be obtained from here (not only your $5$-regular examples). | |
| Jul 10, 2023 at 5:38 | comment | added | Gordon Royle | I think if you take the circulant graph on $2K$ vertices where $K$ is odd and each vertex $x$ is adjacent to $x \pm 1$, $x \pm 3$ and $x + K$ , then this will be a family of $5$-regular examples. | |
| Jul 9, 2023 at 9:08 | history | edited | Licheng Zhang | CC BY-SA 4.0 |
added 116 characters in body
|
| Jul 9, 2023 at 8:56 | history | edited | Licheng Zhang | CC BY-SA 4.0 |
added 17 characters in body
|
| Jul 9, 2023 at 8:37 | history | asked | Licheng Zhang | CC BY-SA 4.0 |