On the number of large h-hypergraphs with a fixed diameter

DOI10.1016/S0012-365X(00)00019-4zbMATH Open0971.05055OpenAlexW1964647626MaRDI QIDQ1587613FDOQ1587613

Authors: Ioan Tomescu 

Publication date: 30 October 2001

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00019-4

Recommendations

• On the number of graphs and \(h\)-hypergraphs with bounded diameter
• scientific article; zbMATH DE number 2147948
• An asymptotic formula for the number of graphs having small diameter
• scientific article; zbMATH DE number 969185
• scientific article; zbMATH DE number 1665442

zbMATH Keywords

diameternumber of labeled \(k\)-hypergraphs

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Hypergraphs (05C65)

Cited In (5)

• On the number of \(h\)-connected graphs with a fixed diameter
• On the number of graphs and \(h\)-hypergraphs with bounded diameter
• Title not available (Why is that?)
• An upper bound on the number of edges of a hypergraph with a given diameter
• Title not available (Why is that?)

This page was built for publication: On the number of large \(h\)-hypergraphs with a fixed diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587613)