Báo cáo toán học: "Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold" pot

... upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Reference-free time-based localization for an asynchronous target EURASIP Journal on Advances in ... estimators using the nonredundant set of TDOAs for locating an asynchronous target. Figure 7. RMSE of x for the REFF estimator using TOAs and the full set of TDOAs for locating...

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

... incident with a common vertex. 3.2 Proof of Theorem 4 Let H be a Hamilton cycle chosen uniformly at random from the set of (n − 1)!/2 Hamilton cycles of K n .Let{(e i ,f i ): 1≤ i ≤ N} be an enumeration of ... Mathematics 62 (1986) 29-33. [8] L.P´osa ,Hamilton circuits in random graphs,Discrete Mathematics 14 (1976) 359-64. [9] P.Winkler, Private Communication. MULTICOLOURED HAMILTON...

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

... matchings and Hamiltonian cycles in random graphs. Annals of Discrete Mathematics 28 (1985) 23-46. [6] B. Bollob´as, T.I. Fenner and A.M. Frieze. An algorithm for finding Hamilton cycles in random graphs. ... Cooper. 1-pancyclic Hamilton cycles in random graphs. Random Structures and Algorithms 3.3 (1992) 277-287 [9] C. Cooper and A. Frieze. Pancyclic random graphs....

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

... A Note on Sparse Random Graphs and Cover Graphs ∗ Tom Bohman † Alan Frieze ‡ Mikl´os Ruszinko Đ Lubos Thoma ả Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, ... a constant κ<2/3, then it outputs a cover graph whp. Note that the output graph will have whp girth equal to 4. On a related note we point to [8] which surveys constructions of no...

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

... the dimension of joining. Then P must contain w disjoint bent cycles that partition the vertices of P . Each of these w cycles must contain a wrapped edge in P along the joining dimension. Further, ... we join the endpoints with red arrows pointing away from each other to create the new wrapped edges in G + P . We thus obtain a bent Hamilton cycle in Q  (5, 3, 3), and by repeated...

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

... edge-disjoint one factors and the existence of k -factors in complete multipartite graphs, Discrete Math. 160 (1996) 177–187. [5] T. Niessen and B. Randerath, Regular factors of simple regular graphs ... Theorems, Jahresber. Deutsch. Math Verein. 97 (1995) 19–42. the electronic journal of combinatorics 11 (2004), #R7 7 On regular factors in regular graphs with smal...

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

... 1-factor F containing e  and thus F is the 1-factor avoiding e. the electronic journal of combina torics 12 (2005), #N23 2 Pan-factorial Property in Regular Graphs ∗ M. Kano 1 and Qinglin Yu 23 1 Department ... 1-factor containing e,so does G ∗ . By Theorem 1, G ∗ has a k-factor containing e and another k-factor avoiding e for all k,1≤ k ≤ 2r − 1. Deleting the matching M from G ∗ ,weo...

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

... maximum lengh of a cycle in unit circulant graphs on a Dedekind domain quotiented by an ideal with r distinct maximal factors. Dedekind domains are exactly those integral domains in which every ideal ... have a new induced k-cycle in X n , since we have not changed the coincidences between any of the rows in C. We now use the Observation 2.5 to define isomorphisms between induced...

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

... These are orientations where the in -degree function, i.e. the function count- ing the number of ingoing edges at each vertex, satisfies given lower and upper bounds. Degree constrained orientations ... Robbins’ theorem on strongly connected orientations. We mention also Thomassen [11] who raised some related conjectures. In this paper, we will focus on degree constrained o...

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

... exp(− ¯ d min /(2C)), the electronic journal of combinatorics 16 (2009), #R138 44 The spectral gap of random graphs with given expected degrees ∗ Amin Coja-Oghlan University of Edinburgh, School of Informatics Crichton ... graphs with with given degree sequences. Random Structures and Algorithms 32 (2008) 1–19 [7] Chung, F., Lu, L.: Connected components in rand...

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

... Chatterjee, S., Concentration of Haar measures, with an application to random ma- trices, J. Funct. Anal. 245 (2007), 379-389. [9] Connes, A. and Kreimer, D., Hopf algebras, renormalization and ... Fulman, J., Separation cutoffs for random walk on irreducible representations, to appear in Ann. Comb., arXiv: math.PR/0703921 (2007) . [17] Fulman, J., Stein’s method and random charac...

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

... cycle space of locally finite in nite graphs. The topological cycle space C(G) of a locally finite gra ph G was introduced by Diestel and Kăuhn [10, 11]. It is built not just from finite cycles, but ... 1.2 in Section 4, after giving the required definitions and basic facts in Section 2 and showing that Proposition 1.1 holds for finite gra phs but not for in nite ones...

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

... contiguity, Combi- natorics Probability and Computing 4 (19 95) 369-405. [5] S. Janson and N. Wormald, Rainbow Hamilton cycles in random regular graphs, Random Structures Algorithms 30 (2007) 35-49. [6] ... If G ∗ contains a rainbow Hamilton cycle, then H contains a loose Hamilton cycle. We will use Theorem 2 to show that whp G ∗ contains an edge coloured graph that is close to...

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

... notion of universal cycles. In particular, we show that these cycles exist for certain classes of labeled graphs. In order to define a universal cycle of graphs, we must first extend the notion of ... Classification: 05C30 Abstract A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of...

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

... terminology. Let H be a random variable which counts the number of loose Hamilton cycles in Λ d such that the edges only intersect in X. Note that every such loose Hamilton cycle induces an ordinary ... Hamilton cycles in random 3 -uniform hypergraphs, Electronic Jour- nal of Combinatorics 17 (2010), N28. [5] A.M. Frieze, M. Jerrum, M. Molloy, R. Robinson and N. Wormald,...

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