Báo cáo toán học: "Arranging numbers on circles to reach maximum total variation" docx

... electronic journal of combinatorics 14 (2007), #R47 2 Arranging numbers on circles to reach maximum total variations Ying-Jie Liao Min-Zheng Shieh Shi-Chun Tsai Department of Computer Science National ... Arranging n distinct numbers on a line or a circle to reach extreme total variations, European J. Combin., 13: 325-334, 1992. [3] G.L. Cohen, E. Tonkes, Dartboard arr...

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

... for 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 non cover ... Combinatorica 11 (1991) 45-54. the electronic journal of combinatorics 7 (2000), #R19 9 [8] O. Pretzel, Orientations and Edge Functions on Graphs, in: A.D.Keedwell (ed.), Surveys in Combina...

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

... (V, E) to be an ˜ f-factor of G where ˜ f(v) = f(v) ∪ {0} for all v ∈ V , and a partial f-factor of G is non-trivial if it is non-empty. Our next result is a sufficient condition for a graph to have ... clearly has no non-trivial partial f-factors, and  v∈V |f(v) c \{0}| = |E|. Theorem 1 can also be extended to hypergraphs, but the appropriate condition on |f(v)| then depends on the...

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

... enough to use numbers from 1 to 16 to construct the electronic journal of combinatorics 15 (2008), #N35 1 first part of the construction), and add 1 to the weight of the edge uv (changing it to 2 or ... assumptions of the lemma (and is not a forbidden one), hence we again obtain a contradiction by induction. the electronic journal of combinatorics 15 (2008), #N35 2 3 Main Result Fo...

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

... #P159 5 A Note on Obstructions to Clustered Planarity Jamie Sneddon Department of Mathematics The University of Auckland, Auckland, New Zealand j.sneddon@auckland.ac.nz Paul Bonnington Monash e-Research ... Σ 1 and Σ 2 are the obstructions to planarity of bipartite graphs. Without cut inversion there are nine obstructions to bipartite planarity, corresponding to the non-isomorphic u...

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

... B,wewrite R(A, A)=R(A). With the usual notations N is the set of natural numbers and R + is the set of positive rational numbers. One may recall here the notion of asymptotic density of a set of positive integers ... N, we can certainly take A to be an infinite set. It serves our purpose to prove that the intersection of the set M (A)withanintervalis non-empty. From the given condition...

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

... A note on odd cycle-complete graph Ramsey numbers Benny Sudakov ∗ Department of Mathematics, Princeton University, Princeton, NJ 08544, USA and Institute for Advanced Study, Princeton, NJ 08540, ... is a positive constant depending on l. A general lower bound for r(C l ,K n )was given by Spencer [8]. Later the asymptotics of r(C 3 ,K n ) was determined up to a constant factor in [1] a...

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

... the following wonderful convolution formulas for central Catalan numbers. Note that on each side of each equation, the total sum of the subindices r in C r is constant (equal to 6, 7, and 8 in ... walks and Catalan factorization,Pro- ceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999). Congr. Numer. 138...

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

... object to the term nonconstructive; however, we wish to clarify it. To this end we formally define two types of constructive proofs. We only define these notions for proofs of lower bounds on W (k, ... called nonconstructive in contrast to constructive pr oofs that provide an efficient algorithm. This paper clarifies these notions and gives d efi nitions for deterministic- and randomized-...

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

... configuration guidelines of the solution de- pending on the scenario where it is deployed and the traffic conditions (Section 5). Finally, we conclude the paper by summarizing the main conclusions ... SLAAC ad- dress configuration time ( ¯ T conf ), by simply consider- ing the two possible configuration situations: (i) there is on average multi-hop connectivity between the un- configured vehicl...

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