10.9k citations
- University of OklahomaUS1.3k papers
- University of ChicagoUS1.3k papers
- Southern Methodist UniversityUS1.3k papers
- University of Illinois Urbana-ChampaignUS1.3k papers
- McGill UniversityCA1.3k papers
- The Ohio State UniversityUS1.3k papers
- University of PittsburghUS1.3k papers
- University of British ColumbiaCA1.2k papers
- Rutherford Appleton LaboratoryGB1.2k papers
- European Organization for Nuclear ResearchCH1.2k papers
- University of AlbertaCA1.2k papers
- University of OxfordGB1.2k papers
Showing 2012 · math.COShow all
3 papers · 2 filters
math.CO2012★ 1 cited
Partitions and compositions over finite fields
Amela Muratović-Ribić, Qiang Wang
In this paper we find exact formulas for the numbers of partitions and compositions of an element into parts over a finite field, i.e. we find the number of nonzero solutions o…
math.CO2012★ 1 cited
A note on packing spanning trees in graphs and bases in matroids
Robert F. Bailey, Mike Newman, Brett Stevens
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where th…
math.CO2012★ 18 cited
Nonrepetitive Colourings of Planar Graphs with Colours
Vida Dujmović, Fabrizio Frati, Gwenaël Joret +1
A vertex colouring of a graph is \emph{nonrepetitive} if there is no path for which the first half of the path is assigned the same sequence of colours as the second half. The \emp…