Exercise 12: Weed Weak models Task 1: Hyper, hyper! Recall that a hypergraph is a graph where edges may comprise more than 2 nodes. The degree of a hyperedge is the number of nodes in it. Consider a hypergraph of maximum

Source URL: resources.mpi-inf.mpg.de

• Graph coloring
• Hypergraphs
• NP-complete problems
• Vertex cover
• Edge coloring
• Matching
• Constraint programming
• ErdsFaberLovsz conjecture
• Constraint graph

TIGHT HAMILTON CYCLES IN RANDOM HYPERGRAPHS ¨ PETER ALLEN*, JULIA BOTTCHER*, YOSHIHARU KOHAYAKAWA†, AND YURY PERSON‡

Source URL: www.math.uni-frankfurt.de

EXACT RESULTS ON THE NUMBER OF RESTRICTED EDGE COLORINGS FOR SOME FAMILIES OF LINEAR HYPERGRAPHS HANNO LEFMANN AND YURY PERSON Abstract. For k-uniform hypergraphs F and H and an integer r ≥ 2, let cr,F (H) denote the n

Source URL: www.math.uni-frankfurt.de

FRACTIONAL AND INTEGER MATCHINGS IN UNIFORM HYPERGRAPHS ¨ DANIELA KUHN, DERYK OSTHUS AND TIMOTHY TOWNSEND Abstract. Our main result improves bounds of Markstr¨

Source URL: web.mat.bham.ac.uk

ON PERFECT MATCHINGS IN UNIFORM HYPERGRAPHS WITH LARGE MINIMUM VERTEX DEGREE ˆ. P HAN, ` HIE YURY PERSON, AND MATHIAS SCHACHT

Source URL: www.math.uni-frankfurt.de

ON ALMOST OPTIMAL UNIVERSAL HYPERGRAPHS arXiv:1509.03983v2 [math.CO] 17 Sep 2015 SAMUEL HETTERICH, OLAF PARCZYK AND YURY PERSON

Source URL: arxiv.org

Local Limit Theorems for the Giant Component of Random Hypergraphs? Michael Behrisch1?? , Amin Coja-Oghlan2? ? ? , and Mihyun Kang3† 1 Institute of Transportation Systems, German Aerospace Center, Rutherfordstrasse 2,

Source URL: www.math.tugraz.at

Hamilton cycles in graphs and hypergraphs: an extremal perspective Abstract. As one of the most fundamental and well-known NP-complete problems, the Hamilton cycle problem has been the subject of intensive research. Rece

Source URL: web.mat.bham.ac.uk

Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs Jørgen Bang-Jensen ∗

Source URL: perso.ens-lyon.fr

A STRUCTURAL RESULT FOR HYPERGRAPHS WITH MANY RESTRICTED EDGE COLORINGS HANNO LEFMANN, YURY PERSON, AND MATHIAS SCHACHT Abstract. For k-uniform hypergraphs F and H and an integer r ≥ 2, let cr,F (H) denote the number o

Source URL: www.math.uni-frankfurt.de