Simple Algebraic Proofs of Uniqueness for Erdős-Ko-Rado Theorems

01/08/2022
by   Yuval Filmus, et al.
0

We give simpler algebraic proofs of uniqueness for several Erdős-Ko-Rado results, i.e., that the canonically intersecting families are the only largest intersecting families. Using these techniques, we characterize the largest partially 2-intersecting families of perfect hypermatchings, resolving a recent conjecture of Meagher, Shirazi, and Stevens.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/26/2020

On the Uniqueness Problem for Quadrature Domains

We study questions of existence and uniqueness of quadrature domains usi...
research
10/01/2018

Degree versions of theorems on intersecting families via stability

The matching number of a family of subsets of an n-element set is the ma...
research
01/12/2019

Simple juntas for shifted families

We say that a family F of k-element sets is a j-junta if there is a set...
research
09/15/2017

Nominal C-Unification

Nominal unification is an extension of first-order unification that take...
research
01/07/2020

Rainbow matchings in k-partite hypergraphs

In this paper, we prove a conjecture of Aharoni and Howard on the existe...
research
05/16/2022

Average-Case Hardness of Proving Tautologies and Theorems

We consolidate two widely believed conjectures about tautologies – no op...
research
08/31/2023

Erdős–Ko–Rado type results for partitions via spread approximations

In this paper, we address several Erdős–Ko–Rado type questions for famil...

Please sign up or login with your details

Forgot password? Click here to reset