๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On small subgraphs in a random intersection digraph

โœ Scribed by Kurauskas, Valentas

Book ID
118737076
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
567 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

One-diregular subgraphs in semicomplete
One-diregular subgraphs in semicomplete multipartite digraphs
โœ Yeo, Anders ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 154 KB

The problem of finding necessary and sufficient conditions for a semicomplete multipartite digraph (SMD) to be Hamiltonian, seems to be both very interesting and difficult. Bang-Jensen, Gutin and Huang (Discrete Math to appear) proved a sufficient condition for a SMD to be Hamiltonian. A strengtheni

Small variance of subgraph counts in a r
Small variance of subgraph counts in a random tournament
โœ Pontus Andersson ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 78 KB

It is known that, for 'most' digraphs D on v vertices, the variance of the number of copies of D in a random tournament on n vertices (chosen uniformly from all such tournaments) is of degree 2v -3 as a polynomial in n. Here we prove that there are arbitrarily large D for which this degree is as sma