Biased Positional Games and Small Hypergraphs with Large Covers Michael Krivelevich ∗

Source URL: page.mi.fu-berlin.de

Phase Transitions in Random Hypergraphs Mihyun Kang Joint work with Oliver Cooley and Christoph Koch Emergence of Giant Component in G(n, p)

Source URL: www.math.tugraz.at

MATCHINGS IN 3-UNIFORM HYPERGRAPHS ¨ DANIELA KUHN, DERYK OSTHUS AND ANDREW TREGLOWN Abstract. We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose tha

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

Conflict-free colorings of graphs and hypergraphs J´anos Pach∗ EPFL, Lausanne and CCNY, New York G´abor Tardos† Simon Fraser University, Burnaby

Source URL: www.renyi.hu

WEAK QUASI-RANDOMNESS FOR UNIFORM HYPERGRAPHS ˆ. P HAN, ` DAVID CONLON, HIE YURY PERSON, AND MATHIAS SCHACHT Abstract. We study quasi-random properties of k-uniform hypergraphs. Our

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

COMPUTING THE PARTITION FUNCTION FOR PERFECT MATCHINGS IN A HYPERGRAPH Alexander Barvinok and Alex Samorodnitsky September 2011 Abstract. Given non-negative weights wS on the k-subsets S of a km-element

Source URL: www.math.lsa.umich.edu

• Graph theory
• Mathematics
• Hypergraphs
• Bipartite graph
• Line graph
• Matching
• Graph factorization
• Permanent
• Line graph of a hypergraph
• Packing in a hypergraph

HAMILTON CYCLES IN GRAPHS AND HYPERGRAPHS: AN EXTREMAL PERSPECTIVE ¨ DANIELA KUHN AND DERYK OSTHUS Abstract. As one of the most fundamental and well-known NP-complete problems, the Hamilton

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

On Extremal Hypergraphs for Hamiltonian Cycles Roman Glebov 1,2 Yury Person 2

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

HYPERGRAPH LIMITS: A REGULARITY APPROACH YUFEI ZHAO Abstract. A sequence of k-uniform hypergraphs H1 , H2 , . . . is convergent if the sequence of homomorphism densities t(F, H1 ), t(F, H2 ), . . . converges for every k-

Source URL: yufeizhao.com

ON COLORINGS OF HYPERGRAPHS WITHOUT MONOCHROMATIC FANO PLANES ˇ ¨ HANNO LEFMANN, YURY PERSON, VOJTECH RODL,

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