On randomly generated non-trivially intersecting hypergraphs.
Patkós, Balázs (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On randomly generated intersecting hypergraphs.”
On randomly generated non-trivially intersecting hypergraphs.
A note on the component structure in random intersection graphs with tunable clustering.
Lagerås, Andreas N., Lindholm, Mathias (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Component evolution in random intersection graphs.
Behrisch, Michael (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The spectral gap of random graphs with given expected degrees.
Coja-Oghlan, Amin, Lanka, André (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the chromatic number of simple triangle-free triple systems.
Frieze, Alan, Mubayi, Dhruv (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
How frequently is a system of 2-linear Boolean equations solvable?
Pittel, Boris, Yeum, Ji-A (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Random matching problems on the complete graph.
Wästlund, Johan (2008)
Electronic Communications in Probability [electronic only]
Similarity:
Constrainted graph processes.
Bolobás, Béla, Riordan, Oliver (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Neighbour-distinguishing edge colourings of random regular graphs.
Greenhill, Catherine, Ruciński, Andrzej (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rainbow -factors of complete -uniform -partite hypergraphs.
Chen, Ailian, Zhang, Fuji, Li, Hao (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On rainbow trees and cycles.
Frieze, Alan, Krivelevich, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Almost all graphs with 2. 522 edges are not 3-colorable.
Achlioptas, Dimitris, Molloy, Michael (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity: