***********************************
                * Princeton Discrete Math Seminar *
                ***********************************

Speaker: Stefan Glock (U Passau)

Thursday 22nd Novmber, 3:00 in Fine Hall 224.

Title: Discrepancy of spanning substructures in hypergraphs

In discrepancy theory, the basic question is whether a structure can be
partitioned in a balanced way, or if there is always some “discrepancy” no
matter how the partition is made. In the context of graph theory, a
well-studied question is whether for a given host graph, any 2-coloring of
its edges must contain a certain substructure "with high discrepancy",
meaning that within this substructure one of the color classes is
significantly larger than the other. Classical results include the works
of Erdos and Spencer on cliques and of Erdos, Füredi, Loebl and Sos on
spanning trees. In this talk, I will present some recent results for
spanning substructures of hypergraphs such as perfect matchings, tight
Hamilton cycles and Steiner triple systems.

Based on joint works with Lior Gishboliner, Peleg Michaeli and Amedeo
Sgueglia.

		----------------------------------

Anyone wishing to be added to or removed from the mailing list should
contact Paul Seymour (pds@math.princeton.edu)