Name
Abstract | ||
|---|---|---|
We prove that the maximum size of a simple binary matroid of rank r >= 5 with no AG(3, 2)-minor is ((r+1)(2)) and characterize those matroids achieving this bound. When r >= 6, the graphic matroid M(Kr+1) is the unique matroid meeting the bound, but there are a handful of matroids of lower ranks meeting or exceeding this bound. In addition, we determine the size function for nongraphic simple binary matroids with no AG(3, 2)-minor and characterize the matroids of maximum size for each rank. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1137/130918915 | SIAM JOURNAL ON DISCRETE MATHEMATICS |
Keywords | Field | DocType |
binary matroids,growth rate | Matroid,Discrete mathematics,Combinatorics,Size function,Graphic matroid,Binary matroid,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
28 | 3 | 0895-4801 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joseph P. S. Kung | 1 | 78 | 20.60 |
| Dillon Mayhew | 2 | 102 | 18.63 |
| Irene Pivotto | 3 | 11 | 3.19 |
| Gordon F. Royle | 4 | 159 | 29.85 |