ON ALMOST OPTIMAL UNIVERSAL HYPERGRAPHS arXiv:1509.03983v3 [math.CO] 13 May 2016 SAMUEL HETTERICH, OLAF PARCZYK AND YURY PERSON Abstract. A hypergraph H is called universal for a family F of hypergraphs, if it contains

Source URL: arxiv.org

Symmetric and asymmetric Ramsey properties in random hypergraphs arXiv:1610.00935v1 [math.CO] 4 OctLuca Gugelmann

Source URL: arxiv.org

SIAM J. DISCRETE MATH. Vol. 25, No. 3, pp. 1331–1348 © 2011 Society for Industrial and Applied Mathematics APPROXIMATING WIDTH PARAMETERS OF HYPERGRAPHS

Source URL: users.uoa.gr

New existence bounds for decoding transition with Q-LDPC codes: percolation on hypergraphs Leonid Pryadko UC, Riverside QEC14: Dec 16, 2014 pe + (1 − pe )[4pX (1 − pX )]1/2 < (wZ − 1)−1

Source URL: www.qec14.ethz.ch

Isomorphic edge disjoint subgraphs of hypergraphs Paul Horn∗ V´aclav Koubek† Vojtˇech R¨odl‡

Source URL: web.cs.du.edu

PARTITIONING HYPERGRAPHS IN SCIENTIFIC COMPUTING APPLICATIONS THROUGH VERTEX SEPARATORS ON GRAPHS ‡ , AND CEVDET AYKANAT§ ¨ ¨ ENVER KAYAASLAN∗ , ALI PINAR† , UMIT

Source URL: www.sandia.gov

Testing and Evaluation of WRF Reference Configurations Michelle Harrold, Jamie Wolff, Zach Trabold, and Louisa Nance National Center for Atmospheric Research (NCAR) 12th Annual WRF User’s Workshop

Source URL: www2.mmm.ucar.edu

• Configuration
• Hypergraphs
• Mathematics
• Weather Research and Forecasting Model

Portable library descriptions for Standard ML Matthias Blume∗ Lucent Technologies, Bell Labs 600 Mountain Avenue, 2C-481 Murray Hill, NJ 07974, USA November 26, 2001

Source URL: people.cs.uchicago.edu

• Graph theory
• Discrete mathematics
• Mathematics
• Graphs
• Graph
• Hypergraphs
• Multigraph

Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs Magnus Bordewich∗, Martin Dyer∗ and Marek Karpinski† August 17, 2006 Abstract

Source URL: community.dur.ac.uk

• Markov processes
• Hypergraph
• Markov chain
• Stopping time
• Spectral theory

On Crown-free Set Families, Diffusion State Difference, and Non-uniform Hypergraphs Edward Boehnlein Let La(n, H) denote the cardinality of the largest family on the Boolean lattice that does not contain H as a subposet.

Source URL: www.gradschool.sc.edu

• Graph theory
• Bipartite graph
• Random graph
• Almost surely
• Hypergraphs