1 citations · 1 across the 4 of their papers we have counts for
5 papers
Very Well-Covered Graphs with the Erdős-Ko-Rado Property
Jessica De Silva, Adam B. Dionne, Aidan Dunkelberg +1
A family of independent -sets of a graph is an -star if every set in the family contains some fixed vertex . A graph is -EKR if the maximum size of an intersecting…
Anti-Ramsey Multiplicities
Jessica De Silva, Xiang Si, Michael Tait +3
The Ramsey multiplicity constant of a graph is the minimum proportion of copies of in the complete graph which are monochromatic under an edge-coloring of as goes…
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…
On the distance spectra of graphs
Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy +8
The distance matrix of a graph is the matrix containing the pairwise distances between vertices. The distance eigenvalues of are the eigenvalues of its distance matrix and…
The combinatorics of interval-vector polytopes
Matthias Beck, Jessica De Silva, Gabriel Dorfsman-Hopkins +2
An \emph{interval vector} is a -vector in for which all the 1's appear consecutively, and an \emph{interval-vector polytope} is the convex hull of a set of in…