I'm president of Unicycle.com in Marietta, Georgia, which is near Atlanta.
Students at the school, which will host Circus Smirkus this summer, have been learning to ride unicycles, juggle and perform mim.
IN EFFECT UNTIL OCT 15, 4:30 p.m. JOSH FARLEY/KITSAP SUN Ian Convy of Kingston rides Sunday's 40th annual Chilly Hilly on a unicycle.
QB more like 'riding a unicycle ' for Terps' Burns.
Brandon Howard, Manassas' Unicycle Man, overcomes accident, house fire.
Brandon Howard, a Manassas teenager known as the Unicycle Man, has had a tough few months.
Brandon Howard, 16, was hit by a car in June, but is back on his unicycle .
Skyflight Productions presents Unicycle Loves You from Chicago, Ill. On Friday, April 13, at The Albert S George Youth Center at Barnesville Memorial Park in Barnesville.
Unicycle Loves You celebrates 'Failure'.
Unicycle Loves You perform "Wow Wave Cinema" from Failure (Mecca Lecca).
When he is not unicycling , Smith enjoys hiking with his dad and has a black belt in Kajukenbo.
Smith has been riding his unicycle for about four months and has no intentions of stopping anytime soon.
I started unicycling during my freshman year of college, and like many of my random hobbies, I just decided I wanted to learn how to do it.
World champion unicyclist Max Schulze jumps over 3 fellow professionals on Friday during a unicycling demonstration and workshop at Harvey Mudd College.
Grant and Ginger VanValkenburg present a large unicycle to unicycle team coaches Dee Clarke and Bob Crichton.
***
For c < 1 the result follows from the fact that the random graph is a collection of trees and unicyclic graphs of logarithmic order, which gives the upper bound, and that there is one of these components with large diameter with respect to its order, providing the lower bound.
On the tree-depth of Random Graphs
We will ﬁrst prove the upper bound. A unicyclic graph (unicycle) is a connected graph that has the same number of vertices than edges, that is, the graph contains exactly one cycle.
On the tree-depth of Random Graphs
Lemma 4.1 If each connected component of G is either a tree or a unicycle, then td(G) ≤ log nc + 2, where nc is the cardinality of the largest connected component of G.
On the tree-depth of Random Graphs
One of the central results of Erd ˝os and R ´enyi [?] states that, if 0 < c < 1, then G is composed by trees and unicycles.
On the tree-depth of Random Graphs
For a unicyclic component, i.e. a tree with an extra edge, we can consider all the k2 colourings of the endpoints of the extra edges and for each of these colourings recurse on the remaining tree.
A simple algorithm for random colouring G(n, d/n) using (2+\epsilon)d colours
***