Skip to content

Ben Barber

mathematical story-telling

  • Research
  • Public speaking

Tag: haskell

The number of maximal left-compressed intersecting families

Published by babarber on February 23, 2018January 4, 2019

A family of sets (subsets of of size ) is intersecting if every pair of sets in have a common element.  If then every pair of sets intersect, so can be as large as .  If then the Erdős–Ko–Rado theorem states that , which (up to relabelling of the ground set) is attained only by the …

Categories

  • Bibliography
  • Scrapbook

Recent Posts

  • Concentration inequalities
  • The Namer-Claimer game, part 2
  • Minimalist designs
  • Isoperimetry in integer lattices
  • Chromatic number of the plane

Tags

colouring concentration conference conjecture containers decompositions flow game graphs haskell inequalities intersecting isoperimetry latin-squares matchings open-problem philosophy progress quasirandomness ramsey random-walks seminar sets thesis
Copyright © 2019 Ben Barber
Theme Simplelin by Mas Abdi