Báo cáo toán học: " Near Threshold Graphs" ppt

... θ |I 1 |,|I 2 | x 2 . 6 Nea r optimal bound of orthogonal matching pursuit using restricted isometric constant Jian Wang, Seokbeop Kwon and Byonghyo Shim ∗ School of Information and Communication, ... formatted PDF and full text (HTML) versions will be made available soon. Near optimal bound of orthogonal matching pursuit using restricted isometric c...

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

... the theories of matroids with coecients and of -matroids with coecients, Beitrăage zur Algebra und Geometrie 37 (1996), 161-198. [682] W. Wenzel: Projective equivalence of ∆ -matroids with coefficients ... W. Wenzel: Projective equivalence of matroids with coefficients, J. Combinatorial Theory, Ser. A 57 (1991), 15-45. [680] W. Wenzel: Combinatorial Algebra of ∆ -Matroids and Related Combi...

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

... is Ω(m 4/3 ). Here we improve this bound and describe an explicit construction of triangle free graphs with independence numbers m and Ω(m 3/2 ) vertices. Our graphs are Cayley graphs and their construc- tion ... Tough Ramsey graphs without short cycles, to appear. [3] N. Alon and N. Kahale, in preparation. [4] N. Alon and J. H. Spencer, The Probabilistic Method, Wiley, 19...

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

... Counting two-graphs related to trees Peter J. Cameron Submitted: October 19, 1994; Accepted: February 8, 1995. Abstract. In an earlier paper, I showed that the classes of pentagon-free two-graphs and ... J. Seidel, A survey of two-graphs, pp. 481–511 in Proc.Int.Colloq.TeorieCombi- natorie, Accad. Naz. Lincei, Roma, 1977. 10. J. J. Seidel and S. V. Tsaranov, Two-graphs, related gr...

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

... the harmonization operation we forget C  and rename C ∗ as C  . For which graphs does every edge belong to exactly two chordless cycles? UriN.Peled 1 and Julin Wu 2 Dept. of Mathematics, Statistics, ... same operation to P  , and so on until we obtain a chordless path P ∗ connecting x 1 to x k .ForacycleC of G andanedgee of C, we can apply the above operation...

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

... towards accounting for the wastefulness of the first moment method. Instead of Almost all graphs with 2.522n edges are not 3-colorable Dimitris Achlioptas ∗ optas@cs.toronto.edu Michael Molloy † molloy@cs.toronto.edu Department ... in that the selection is done with replacement, i.e. multiple edges are allowed. We will denote this model by G r (n, m). Intuitively, it is cl...

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

... V (G). A composition of G is a partition of V (G) into vertex sets of connected induced subgraphs of G. Thus a composition provides a set of connected induced subgraphs of G, {G 1 , G 2 , · · ... composition of a graph G is a partition of the vertex set of G into vertex sets of connected induced subgraphs of G. Knopfmacher and Mays [2] found an explicit formula for C(K m...

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

... d(G π , s) ≥ n − k(G, s) and therefore d(G π , s) > n/2 for n ≥ 4d 2 (4d + 3). ♣ the electronic journal of combinatorics 14 (2007), #R44 16 Information flows, graphs and their guessing numbers Søren ... bits and n output bits, and where the depth of the circuit is in O(log(n)). For a detailed discussion and further survey of this class of problems and their link to...

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

... Section 2 we construct our main tools to study the Erd˝os problem over finite Euclidean and non -Euclidean spaces, the finite Eu- clidean and non -Euclidean graphs. Our construction follows one of Bannai, ... concise, we will restrict our discussion to the finite non- Euclidean graphs obtained from the action of the simple orthogonal group on the set of non-isotropic p...

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

... bijection between the set of vertices of G and the set of vertices of H. We now show that given any pair a, b of vertices of G (which might also coincide), the set E(a, b) of edges between these ... journal of combinatorics 16 (2009), #N6 1 of f(a) and thus the 3ε-neighborhood of f (a) is a simple arc (lying in the interior of some edge) in H. Consider the points a 1 ,...

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

... Laplacian spectrum of weakly quasi -threshold graphs, Graphs and Combinatorics, to appear. [2] H. Christianson and V. Reiner, The critical group of a threshold graph, Linear and its Applications 349 ... graph in terms of the number of cutpoints, Linear and Multilinear Algebra 47 (2000), 93-1 03. [8] S. Kirkland, Constructably Laplacian Integral Graphs, Linear Algebra and its Appli- cations...

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

... (1.12)–(1.13). 2 Uniform random even subgraphs 2.1 Finite graphs In the case p = 1 2 in (1.1), every even subgraph has the same probability, so ρ 1 2 describes a uniform random even subgraph of G. Such ... by Proposition 2.2. (It is also easy to give a direct proo f.) 2.2 Infinite graphs Here, and only here, we consider even subgraphs of infinite graphs. Let G = (V, E) be a locally...

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

... probability that a random threshold graph is Hamiltonian. There is a nice connection between Hamiltonicity and a threshold graph’s creation sequence. For more background on Hamiltonian threshold graphs, ... natural, equivalent models for random threshold graphs and use these models to deduce a variety of properties of random threshold graphs. Specifically, a random threshold graph...

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

... Random Threshold Graphs Elizabeth Perez Reilly Edward R. Scheinerman Department of Applied Mathematics and Statistics Johns ... natural, equivalent models for random threshold graphs and use these models to deduce a variety of properties of random threshold graphs. Specifically, a random threshold graph G is generated ... {(T n , P ′ ) : n  1}. We call T 1 the...

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

... journal of combinatorics 18 (2011), #P36 6 Sharp threshold functions for random intersection graphs via a coupling method. Katarzyna Rybarczyk Faculty of Mathematics and Computer Science, Adam ... p) using intermediate auxiliary random graphs. From them we can deduce the assertion of the theorem. First recall (see for example [8]) that if for some graph valued rando...

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