The number of connected sparsely edged uniform hypergraphs

@article{Karonski1997TheNO,
  title={The number of connected sparsely edged uniform hypergraphs},
  author={Michal Karonski and Tomasz Luczak},
  journal={Discrete Mathematics},
  year={1997},
  volume={171},
  pages={153-167}
}
Certain families of d-uniform hypergraphs are counted. In particular, the number of connected d-uniform hypergraphs with r vertices and r + k hyperedges, where k = o(log r/log tog r) , is found. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

The evolution of random graphs

B. Bollobfis
Trans. Amer. Math. Soc • 1984
View 8 Excerpts
Highly Influenced

The structure of the random graph at the double-jump threshold

T. Luczak, B. Pittel, J. C. Wierman
Trans. Amer. Math. Soc • 1994

Pit-tel, The birth of the giant component

S. Janson, D. E. Knuth, B. T. Euczak
Random Struct. Algorithms • 1993

On the number of sparse connected graphs

T. Euczak
Random Struct. Algorithms • 1990

On connected graphs I Magyar Tud

A. Rrnyi
Akad . Mat . Kutat 6 Int . Krzl • 1989

Random Graphs

B. Bollobfis
1985

Similar Papers

Loading similar papers…