activity
20062024
most citedErdös-Ko-Rado theorems for chordal and bipartite graphs

4 citations · 5 across the 13 of their papers we have counts for

collaborators

14 papers

math.CO2024

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…

math.CO2019

An Erdős-Ko-Rado Theorem for unions of length 2 paths

Carl Feghali, Glenn Hurlbert, Vikram Kamat

A family of sets is intersecting if any two sets in the family intersect. Given a graph and an integer , let denote the family of independent se…

math.CO2019

Erdős-Ko-Rado theorems on the weak Bruhat lattice}

Susanna Fishel, Glenn Hurlbert, Vikram Kamat +1

Let be a lattice. For we say that is -{\it intersecting} if for all . Th…

math.CO2017★ 1 cited

Chvátal's conjecture for downsets of small rank

Eva Czabarka, Glenn Hurlbert, Vikram Kamat

A starting point in the investigation of intersecting systems of subsets of a finite set is the elementary observation that the size of a family of pairwise intersecting subsets of…

math.CO2016

On intersecting families of independent sets in trees

Glenn Hurlbert, Vikram Kamat

A family of sets is intersecting if every pair of its sets intersect. A star is a family with some element (a center) in each of its sets. The classical 1961 result of Erdős, Ko, a…

math.CO2016

New injective proofs of the Erdős--Ko--Rado and Hilton--Milner theorems

Glenn Hurlbert, Vikram Kamat

A set system F is intersecting if any pair of sets in F have a nonempty intersection. A fundamental theorem of Erdős, Ko and Rado states that if F is an intersecting family of r-su…