W. Duckworh and M. Zito, Large independent sets in random regular graphs, Theoretical Computer Science, vol.410, issue.50, pp.5236-5243, 2009.
DOI : 10.1016/j.tcs.2009.08.025

H. Hatami and X. , The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three, SIAM Journal on Discrete Mathematics, vol.23, issue.4, pp.1762-1775, 2009.
DOI : 10.1137/080712635

A. M. Frieze and S. Suen, On the independence number of random cubic graphs, Random Structures and Algorithms, vol.54, issue.5, pp.649-664, 1994.
DOI : 10.1002/rsa.3240050504

J. Hladk´yhladk´y, Bipartite subgraphs in a random cubic graph, 2006.

C. Hoppen, Properties of graphs with large girth, 2008.

B. D. Mckay, Maximum bipartite subgraphs of regular graphs with large girth, Proceedings of the 13th Southeastern Conf. on Combinatorics , Graph Theory and Computing, 1982.

B. D. Mckay, Independent sets in regular graphs of high girth, pp.179-185, 1987.

N. C. Wormald, The asymptotic distribution of short cycles in random regular graphs, Journal of Combinatorial Theory, Series B, vol.31, issue.2, pp.168-182, 1981.
DOI : 10.1016/S0095-8956(81)80022-6

N. C. Wormald, Differential Equations for Random Processes and Random Graphs, The Annals of Applied Probability, vol.5, issue.4, pp.1217-1235, 1995.
DOI : 10.1214/aoap/1177004612

O. Z´ykaz´yka, On the bipartite density of regular graphs with large girth, Journal of Graph Theory, pp.631-634, 1990.

. For-i-in, for C in C2 : deg1 = False for x in C : if x = = 1 : deg1 = True break if deg1 : continue N = { } C_p = C2 [ C ] if ( C [ 1 ] = = 3 ) : C_p * = s33 elif ( C [ 1 ] = = 2 ) : C_p * = ( 1 -p_2 ) * p3_n if, } N [ 2 ] [ 1 ] = 1 -N [ 2 ] [ 0 ] elif ( C [ 2 ] = = 2 ) : C_p * = ( 1 -p_2 ) * p3_n N [ 2 ] = { 0 : 1 } elif ( C [ 0 ] = = 3 ) : for i in, p.if