Evaluations asymptotiques du nombre des cliques des hypergraphes uniformes

DOI10.1007/BF02576163zbMath0497.05047MaRDI QIDQ1170204

Ioan Tomescu

Publication date: 1981

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/15791

zbMATH Keywords

polynomial time algorithmuniform hypergraphclique

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Algorithms in computer science (68W99)

Related Items (1)

Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Evaluations asymptotiques du nombre des cliques des hypergraphes uniformes