Counting Connected Uniform Hypergraphs
|Affiliation:||University of Waterloo|
|Room:||Mathematics and Computer Building (MC) 5158|
In this talk, we will present an asymptotic result about the number of connected 3-uniform hypergraphs with n vertices and m edges. We will discuss the range m=n/2+o(n). Our strategy makes use of random hypergraphs and it is similar to Pittel and Wormald's approach to obtain an asymptotic formula for the number of connected graphs with given number of vertices and edges.
200 University Avenue West
Waterloo, ON N2L 3G1