1.6k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of Wisconsin–MadisonUS48 papers
- University of Colorado BoulderUS42 papers
- Vanderbilt UniversityUS38 papers
- University of South CarolinaUS35 papers
- Fermi National Accelerator LaboratoryUS34 papers
- University of California, DavisUS34 papers
- University of Illinois Urbana-ChampaignUS34 papers
- Korea UniversityKR33 papers
- University of Puerto Rico-MayaguezPR33 papers
- Centro Brasileiro de Pesquisas FísicasBR32 papers
- Centro de Investigación y de Estudios Avanzados del Instituto Politécnico NacionalMX32 papers
- Indiana University BloomingtonUS32 papers
5 papers · 1 filter
Unimodality of the independence polynomials of non-regular caterpillars
Patrick Bahls, Bailey Ethridge, Levente Szabo
The independence polynomial of a graph is the polynomial in variable in which the coefficient on gives the number of independent subsets $S \subseteq…
On the Ramsey Numbers of Trees with Small Diameter
Patrick Bahls, T. Scott Spencer
We estimate the Ramsey number r(T) = r(T,T) for various trees T, obtaining a precise value for r(T) for a large number of trees of diameter 3. Furthermore we prove that all trees o…
Generalizing -goodness to ordered graphs
Jeremy F. Alm, Patrick Bahls, Kayla Coffey +1
It is known that the connected graphs that are -good for all are the trees. In this paper, we ask which ordered trees are order--good for all .
Rectangle Free Coloring of Grids
Stephen Fenner, William Gasarch, Charles Glover +1
A two-dimensional \emph{grid} is a set $\Gnm = [n]\times[m]$. A grid $\Gnm$ is \emph{-colorable} if there is a function $χ_{n,m}: \Gnm \to [c]$ such that there are no rectangles…
The Terwilliger algebra of an almost-bipartite P- and Q-polynomial association scheme
John S. Caughman, Mark S. MacLean, Paul M. Terwilliger
Let denote a -class symmetric association scheme with , and suppose is almost-bipartite P- and Q-polynomial. Let denote a vertex of and let de…