Timeline for Maximal number of smallest circuits in a matroid
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30, 2020 at 18:35 | comment | added | Antoine Labelle | Oh, you're right... I was hoping that this bound could have given some matroid theoritic version of Moore graphs, but this probably can't work | |
| Jun 30, 2020 at 17:51 | comment | added | Gjergji Zaimi | If you leave the world of graphical matroids, no such small bound can hold. The number of shortest circuits in a uniform matroid $U_{m,r}$ is $\binom{m}{r+1}$. | |
| Jun 30, 2020 at 13:41 | history | edited | Antoine Labelle |
edited tags
|
|
| Jun 30, 2020 at 13:40 | review | First posts | |||
| Jun 30, 2020 at 13:55 | |||||
| Jun 30, 2020 at 13:36 | history | asked | Antoine Labelle | CC BY-SA 4.0 |