𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Subgraphs of Random Match-Graphs

✍ Scribed by Jerzy Jaworski; Zbigniew Palka


Publisher
Springer Japan
Year
2001
Tongue
English
Weight
117 KB
Volume
17
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Pancyclic subgraphs of random graphs
✍ Choongbum Lee; Wojciech Samotij πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 249 KB

## Abstract An __n__‐vertex graph is called pancyclic if it contains a cycle of length __t__ for all 3≀__t__≀__n__. In this article, we study pancyclicity of random graphs in the context of resilience, and prove that if __p__>__n__^βˆ’1/2^, then the random graph __G__(__n, p__) a.a.s. satisfies the f

Extremal subgraphs of random graphs
✍ LΓ‘szlΓ³ Babai; MiklΓ³s Simonovits; Joel Spencer πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 1015 KB

## Abstract We shall prove that if __L__ is a 3‐chromatic (so called β€œforbidden”) graph, and β€”__R__^__n__^ is a random graph on __n__ vertices, whose edges are chosen independently, with probability __p__, and β€”__B__^__n__^ is a bipartite subgraph of __R__^__n__^ of maximum size, β€”__F__^__n__^ is a

Spanning subgraphs of random graphs
✍ Noga Alon; ZoltΓ‘n FΓΌredi πŸ“‚ Article πŸ“… 1992 πŸ› Springer Japan 🌐 English βš– 183 KB
Random Subgraphs of Cayley Graphs overp-
✍ C.M. Reidys πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 146 KB

The subject of this paper is the size of the largest component in random subgraphs of Cayley graphs, X n , taken over a class of p-groups, G n . G n consists of p-groups, G n , with the following properties: , where K is some positive constant. We consider Cayley graphs X n = (G n , S n ), where S

K4-free subgraphs of random graphs revis
✍ S. Gerke; H. J. PrΓΆmel; T. Schickinger; A. Steger; A. Taraz πŸ“‚ Article πŸ“… 2007 πŸ› Springer-Verlag 🌐 English βš– 400 KB