4 citations · 4 across the 9 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
Turán numbers of vertex-disjoint cliques in -partite graphs
Jessica De Silva, Kristin Heysse, Adam Kapilow +2
For two graphs and , the Turán number is the maximum number of edges in a subgraph of that contains no copy of . Chen, Li, and Tu determined the Turán numbe…
math.CO2016
A forest building process on simple graphs
Zhanar Berikkyzy, Steve Butler, Jay Cummings +4
Consider the following process on a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in…
math.CO2016
A construction of distance cospectral graphs
Kristin Heysse
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding…