4 papers · 1 filter
EKR-Type Theorems for Pendant Graph Constructions
Michael Carrion, Melissa M. Fuentes, Zaphenath Joseph +1
The classical Erdős--Ko--Rado (EKR) theorem characterizes the maximum size of intersecting families of -element subsets of an -element set. We study EKR-type questions for in…
On intersecting families of subgraphs of perfect matchings
Melissa M. Fuentes, Vikram Kamat
The seminal Erdős--Ko--Rado (EKR) theorem states that if is a family of -subsets of an -element set for such that every pair of subsets in $\mat…
The extremality of 2-partite Turán graphs with respect to the number of colorings
Melissa M Fuentes
We consider a problem proposed by Linial and Wilf to determine the structure of graphs that allows the maximum number of -colorings among graphs with vertices and edges.…
Hadamard diagonalizable graphs of order at most 36
Jane Breen, Steve Butler, Melissa Fuentes +7
If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries , then the matrix formed by taking the columns as the eigenvectors is a Hadamard mat…