Báo cáo toán học: "Consistent cycles in 1 -arc-transitive graphs 2" ppsx

... signature [1, 1] . The two thus obtained directed cycles with signatures [0, 0] and [1, 1] are chiral, and one is the inverse of the other, resulting in a single orbit of 1 2 -consistent undirected cycles. On ... of H into cycles. the electronic journal of combinatorics 16 (2009), #R5 8 Figure 3: 1 2 -consistent cycles of length 18 . The consistent cycles of length 9 can b...

Ngày tải lên: 07/08/2014, 21:21

... switchings. Condition (b) eliminates O(r)(nd(d − 1) ) r 1 (d − 1) g +1 choices. Finally, condition (c) eliminates O(r)(nd(d 1) ) r 1 g/2  k =1 (d − 1) g−k+2 = O(r)(nd(d − 1) ) r 1 (d − 1) g/2 +1 , which ... (19 88), 1 10 . [10 ] N. C. Wormald, The asymptotic distribution of short cycles in random regular graphs, J. Combin. Theory, Ser. B 31 (19 81) 16 8 18 2. [11...

Ngày tải lên: 07/08/2014, 08:20

... sequences of integers, I, Ann. Univ. Sci. Budapest E¨otv¨os, 12 (19 69), 13 1 -13 5, II., Publ. Math. Debrecen, 27 (19 80), 11 7 -12 5. [10 ] R.L. Graham, M. Gr¨otschel, L. Lov´asz (editors), Handbook of Combinatorics, ... (G)andE(H) ⊂ E(G). 1 Mathematics Subject Classification 11 B75,05C38 1 the electronic journal of combinatorics 4 (no. 2) (19 97), #R8 10 ≥ n P r  p|b i p>r ...

Ngày tải lên: 07/08/2014, 06:22

... Ser. B 74 (19 98), 405-407. [10 ] J. Shen, On the girth of digraphs. Discrete Math. 211 (1- 3) (2000), 16 7 -18 1. [11 ] J. Shen, On the Caccetta-Haggkvist conjecture, accepted by Graphs Combin. 18 (3) (2002), ... short cycles in digraphs, Discrete Math. 66 (19 87), 10 3 -10 7. [8] T. Nishimura, Short cycles in digraphs, Discrete Math. 72 (19 88), 295-298. [9] J. Shen, Directe...

Ngày tải lên: 07/08/2014, 07:21

... ordering 7, 4, 11 , 2, 8, 14 , 1, 5, 12 , 16 , 15 , 9, 3, 13 , 6, 10 . (3 .1) In general, if the sequence is s 1 , ,s n ,wedefinez j =x s j for 1 ≤ j ≤ n.(Forn= 16 , we have z 1 = x 7 , z 2 = x 4 , z 3 = x 11 ,andsoone.) We ... E. M. Rains, On longest increasing subsequences in random permutations, to be published. the electronic journal of combinatorics 4 (no. 2) (19 97),...

Ngày tải lên: 07/08/2014, 06:22

... ,k} and 2p +2−j ∈ {1, ,p}). • If j = p +1thenθ =(p + 1) (2i +1) and – if i< k +1 2 , g(x 1 ,x 2 , ,x (k +1) p+i +1 +1, ,x n )=g(x)+θ – if i ≥ k +1 2 , g(x 1 ,x 2 , ,x (k +1) p+k−i +1 − 1, ,x n )=g(x)+θ ... j)x ip+j +  k +1 2 l =1 (p + 1) (2l − 1) x (k +1) p+l mod (k + 1) (2p +2) That is g(x)=x 1 +2x 2 + + px p +(2p +3)x p +1 +(2p +4)x p+2 + +(3p +2)x 2p + +(k(2p +2) +1)...

Ngày tải lên: 07/08/2014, 13:21

... Transactions on Information Theory, vol 44, pp. 599- 611 , 19 98. [6] A. Lobstein, Bibliography on identifying and locating-dominating codes in graphs, http://www.infres.enst.fr/∼lobstein/debutBIBidetlocdom.pdf [7] ... v 1 , · · · , v n 1 and the n − 1 edges v i v i +1 for 0 ≤ i ≤ n − 1. As the path P 2r +1 on 2r + 1 vertices is itself r-twin-free, the previous results show tha...

Ngày tải lên: 07/08/2014, 15:22

... combinatorics 14 (2007), #R17 11 Examples for intersection graphs are the well studied interval graphs on the real line, in this paper however we will only consider finite sets. A random intersection ... for c > 1 Then we have a.a.s. N(G n,m,p ) ≤ 9 (1 − c) 2 ln n for α > 1 and c < 1 (1) N(G n,m,p ) = (1 + o (1) ) (1 − ρ)n for α > 1 and c > 1 (2) N(G n,m,...

Ngày tải lên: 07/08/2014, 15:22

... induced trees in graphs, J. Combin. Theory Ser. B 41 (19 86), no. 1, 61 79. [3] Wenceslas Fernandez de la Vega, Induced trees in sparse random graphs, Graphs Com- bin. 2 (19 86), no. 3, 227–2 31. [4] ... occurred in Lemma 3 .1, we have |M  i 1 | ≥ (1 − 1 t )|M i |. Then we apply Lemma 4 .1 with η = 1 t to the graph Γ induced in G by M  i 1 . If case (IS) applies in...

Ngày tải lên: 07/08/2014, 15:23

... in dense graphs, Random Structures Algorithms 9 (19 96), no. 1- 2, 19 3- 211 . [3] J. Koml´os, G.N. S´ark¨ozy & E. Szemer´edi, On the P´osa-Seymour conjecture, J. Graph Theory 29 (19 98), 16 7 -17 6. [4] ... combinatorics 15 (2008), #R60 11 Next we define ξ = 1 3 ε 2  1 − α α   2 α, (2) ξ  = 1 8 ε(ε − α)ξ, (3) d 1 = d − ε + 2ξ and d 2 = d 3 = d − ε + 2 ε 2 α  − ξ. Not...

Ngày tải lên: 07/08/2014, 15:23