Báo cáo toán học: "Decompositions of graphs into 5-cycles and other small graphs" ppsx

... Decompositions of graphs into 5-cycles and other small graphs Teresa Sousa ∗ Tepper School of Business Carnegie Mellon University Pittsburgh, PA 15213 tmj@andrew.cmu.edu Submitted: ... non-complete graphs of order 4 and single edges. Let H be one of the following graphs. Theorem 2.4. Any graph of order n,withn ≥ 4, can be decomposed into at most  n 2 4  copie...

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

... symbols S 1 , S 2 ,andS 3 are the stop codons TAA, TAG, and TGA in the given DNA strand, and S  1 ,S  2 ,andS  3 are the stop codons AGT, GAT, and AAT on the opposite DNA strand, as shown in ... detection of protein-binding sites of the genes and detection of regions that code for proteins. These problems still are not satisfactorily solved, and the reliable detection of...

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

... J., Deift P. and Johansson K., On the distribution of the length of the longest increasing subsequence of random permutations. 1999 J. Amer. Math. Soc. 12 1119– 1178. [5] Aldous D. and Diaconis ... provided for the moments of characteristic polynomials of random unitary matrices. This leads to a rather unexpected con- sequence of the Keating and Snaith conjecture: the moment...

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

... (x, y)ofelementsfromA n (respectively, S n ) such that the parts of Π are the orbits of the group x, y generated by x and y. Similarly let g A (Π) and g S (Π), respectively, be the number of pairs ... Odlyzko, Asymptotic enumeration methods, in “Handbook of Combinatorics (Vol.II)”(eds.:R.L.Graham,M.Gr¨otschel and L. Lov´asz), M.I.T. Press and North- Holland, 1995 (pp. 1063–1...

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

... regarding the moments and limiting distribution of the individual entries of a random unitary matrix. The matrix U k is called the kth truncation of U. Truncations of random unitary matri- ces ... likely analogues of Theorem 1 for truncations of random orthogonal and symplectic matrices. 6 Acknowledgements I am grateful to Roland Speicher and Jamie Mingo for helpful discussi...

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

... 60-61. [MS65] T. Motzkin and E. Strauss. Maxima for graphs and a new proof of a theorem of Turan, Canadian Journal of Mathematics, 17 (1965), 533–540. [M06] D. Mubayi, A hypergraph extension of Tur´an’s theorem, ... extremal problems of graphs and generalized graphs, Israel J. Math. 2 (1964), 183–190. [E71] P. Erd˝os, On some extremal problems on r -graphs, Disc. Math. 1...

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

... switching. Equivalenttoatwo-graphandtoa(signed-)switchingclassofsignedcomplete graphs. The members of the Seidel switching class are the negative subgraphs of the members of the signed switching class. switching isomorphism (of two simple graphs) Notation: ... balance and imbalance of circles. switching isomorphism (of signed, gain, or bidirected graphs) Notation:  • Any com...

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

... in [6], and proven there for a special case.) This can be interpreted in terms of random embeddings of pairs of graphs in K n . Theorem 1, discusses random embeddings of t-tuples of graphs. In ... the proof, we speak of the probability of various events, and evaluate the expected value of some random variables. The underlying probability space for all this is the set o...

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

... indecomposable subgraphs are independent of the order of the decomposition [14, Prop.4.1]. The resulting components are the simplicial summands of G. A graph is chordal if and only if all its simplicial summands ... application of the ↔-partition of R we derive bounds on the number of distinct minimal cycle bases of G. the electronic journal of combinatorics 7 (2000), #R16 1...

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

... journal of combinatorics 5 (1998), #R7 13 and contains one of the graphs r(K 3 ,H) = 19 if and only if H c is contained in one of the graphs and contains one of the graphs the electronic journal of ... contained in one of the graphs and contains the graph r(K 3 ,H) = 23 if and only if H c is contained in one of the graphs and contains one of the graphs...

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