𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Subgraphs of Weakly Quasi-Random Oriented Graphs

✍ Scribed by Amini, Omid; Griffiths, Simon; Huc, Florian

Book ID
118197133
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
343 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extremal subgraphs of random graphs
Extremal subgraphs of random graphs
✍ Graham Brightwell; Konstantinos Panagiotou; Angelika Steger πŸ“‚ Article πŸ“… 2012 πŸ› John Wiley and Sons 🌐 English βš– 698 KB
Subgraphs of Random Match-Graphs
Subgraphs of Random Match-Graphs
✍ Jerzy Jaworski; Zbigniew Palka πŸ“‚ Article πŸ“… 2001 πŸ› Springer Japan 🌐 English βš– 117 KB
Extremal subgraphs of random graphs
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
Spanning subgraphs of random graphs
✍ Noga Alon; ZoltΓ‘n FΓΌredi πŸ“‚ Article πŸ“… 1992 πŸ› Springer Japan 🌐 English βš– 183 KB
Pancyclic subgraphs of random graphs
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