*********************************** * Princeton Discrete Math Seminar * *********************************** Date: Friday 14th February, 4:30 in Fine Hall 224. Speaker: Alex Scott (Oxford) Title: Hypergraphs of bounded disjointness A k-uniform hypergraph is said to be intersecting if no pair of edges is disjoint. The maximal size of an intersecting k-uniform hypergraph with a given groundset is given by the beautiful and well-known theorem of Erdos, Ko and Rado. A k-uniform hypergraph is s-almost intersecting if every edge is disjoint from exactly s other edges. Gerbner, Lemons, Palmer, Patkos and Szecsi made a conjecture on the maximal number of edges in such a hypergraph. We prove a strengthened version of this conjecture and determine the extremal graphs. We also give some related results and conjectures. Joint work with Elizabeth Wilmer. ----------- Next week: Esther Ezra Anyone wishing to be added to or removed from this mailing list should contact Paul Seymour (pds@math.princeton.edu)