6 papers
Intersecting Families of Spanning Trees of
Gordian C. Bruns, Dheer Noal Desai, Alexander L. Gavrilyuk +2
A family of spanning trees of a graph is -intersecting if any pair of spanning trees in the family has or more edges in common. For sufficiently large and $t \leq n/C\lo…
Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings
Gilad Chase, Neta Dafni, Yuval Filmus +1
We give a characterization of the largest -intersecting families of permutations of and of perfect matchings of the complete graph for all …
Forbidden Intersection Theorems for Matrix Spaces
Esty Kelman, Nathan Lindzey, Ohad Sheinfeld
A family of matrices is {-intersection-free} if for all . A \em…
An Eventown Result for Permutations
Nathan Lindzey
A family of permutations is even-cycle-intersecting if has an even cycle for all . We show that if $\mathcal{F} \subse…
On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
Yu Hin Au, Nathan Lindzey, Levent Tunçel
We explore some connections between association schemes and the analyses of the semidefinite programming (SDP) based convex relaxations of combinatorial optimization problems in th…
Intersecting Families of Spanning Trees
Peter Frankl, Glenn Hurlbert, Ferdinand Ihringer +4
A family of spanning trees of the complete graph on vertices is \emph{-intersecting} if any two members have a forest on edges in common. We prove an…