Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes

DOI10.1016/0012-365X(82)90130-3zbMath0488.05051MaRDI QIDQ1165870

Wenceslas Fernandez de la Vega

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphsmaximum matchinguniform hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (7)

Networks beyond pairwise interactions: structure and dynamics ⋮ Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number ⋮ Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation ⋮ Almost perfect matchings in random uniform hypergraphs ⋮ Average case analysis of greedy algorithms for optimisation problems on set systems ⋮ Matchings and covers in hypergraphs ⋮ Component structure in the evolution of random hypergraphs

Cites Work

• Unnamed Item
• On the existence of a factor of degree one of a connected random graph

This page was built for publication: Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes