Báo cáo toán học: "Explicit Ramsey graphs and Erd˝s distance problems o over finite Euclidean and non-Euclidean spaces" ppt

Báo cáo toán học: " A novel method for crystalline silicon solar cells with low contact resistance and antireflection coating by an oxidized Mg layer" ppt

Báo cáo toán học: " A novel method for crystalline silicon solar cells with low contact resistance and antireflection coating by an oxidized Mg layer" ppt

... appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. A novel method for crystalline silicon solar cells with low contact resistance and antireflection ... in any medium, provided the original work is properly cited. A novel method for crystalline silicon solar cells with low contact resis...

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

14 648 0
Báo cáo toán học: " Impact of changes in diet on the availability of land, energy demand, and greenhouse gas emissions of agriculture" docx

Báo cáo toán học: " Impact of changes in diet on the availability of land, energy demand, and greenhouse gas emissions of agriculture" docx

... article as: Fazeni and Steinmüller: Impact of changes in diet on the availability of land, energy demand, and greenhouse gas emissions of agriculture. Energy, Sustainability and Society 2011 1:6. Submit ... examined simultaneously. Existing studies on this topic often focus on the impact of dietary choices either on energy and emissions...

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

14 457 0
Báo cáo toán học: "ON RAMSEY MINIMAL GRAPHS" doc

Báo cáo toán học: "ON RAMSEY MINIMAL GRAPHS" doc

... C.C.Rousseau and R.H.Schelp, Ramsey minimal graphs for star forests, Discrete Math. 33 (1981), 227–237. [4] S.A.Burr, P.Erd˝os, R.J.Faudree, C.C.Rousseau and R.H.Schelp, Ramsey minimal graphs for match- ings,inThe ... Threshold functions for Ramsey properties,submitted. Key words and phrases: critical graphs, Ramsey theory 1991 Mathematics Subject Classifications: 05D10, 05C80 4 O...

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

4 309 0
Báo cáo toán học: "Explicit Ramsey graphs and orthonormal labelings" pdf

Báo cáo toán học: "Explicit Ramsey graphs and orthonormal labelings" pdf

... 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

8 295 0
Báo cáo toán học: "All Ramsey numbers r(K3, G) for connected graphs of order 9" pps

Báo cáo toán học: "All Ramsey numbers r(K3, G) for connected graphs of order 9" pps

... 1998 Abstract We determine the Ramsey numbers r(K 3 ,G) for all 261080 connected graphs of order 9 and further Ramsey numbers of this type for some graphs of order up to 12. Almost all of them were determined ... containing triangle-free graphs of order r which are (or might be) Ramsey graphs for (K 3 ,H) the electronic journal of combinatorics 5...

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

20 273 0
Báo cáo toán học: "On a theorem of Erd˝s, Rubin, and Taylor on o choosability of complete bipartite graphs" pptx

Báo cáo toán học: "On a theorem of Erd˝s, Rubin, and Taylor on o choosability of complete bipartite graphs" pptx

... ,|E|, assign to w i,j the list L(w i,j )=e j . the electronic journal of combinatorics 9 (2002), #N9 2 On a theorem of Erd˝os, Rubin, and Taylor on choosability of complete bipartite graphs Alexandr ... t-coloring of a hypergraph H is panchromatic if each of the t colors is used on every edge of G. Thus, an ordinary 2-coloring is panchromatic. Some results...

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

4 255 0
Báo cáo toán học: "On the Graphs of Hoffman-Singleton and Higman-Sims" docx

Báo cáo toán học: "On the Graphs of Hoffman-Singleton and Higman-Sims" docx

... same family of maximum cocliques of X and hence there exists an automorphism of Z mapping X to Y . Proof. The statement of the lemma gives sufficient indication of the proof. We note that the lemma ... The subgraph of order 80 induced by four of these subgraphs W i is identified as the second orbit of the stabiliser of the remaining one of these graphs in...

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

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

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

7 221 0
Báo cáo toán học: "Information flows, graphs and their guessing numbers" pptx

Báo cáo toán học: "Information flows, graphs and their guessing numbers" pptx

... 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

17 249 0
Báo cáo toán học: "Explicit Ramsey graphs and Erd˝s distance problems o over finite Euclidean and non-Euclidean spaces" ppt

Báo cáo toán học: "Explicit Ramsey graphs and Erd˝s distance problems o over finite Euclidean and non-Euclidean spaces" ppt

... 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

18 252 0
Báo cáo toán học: "The Ramsey number of diamond-matchings and loose cycles in hypergraphs" potx

Báo cáo toán học: "The Ramsey number of diamond-matchings and loose cycles in hypergraphs" potx

... p l } and we join vertices x and the electronic journal of combinatorics 15 (2008), #R126 10 The Ramsey number of diamond-matchings and loose cycles in hypergraphs Andr´as Gy´arf´as ∗ Computer and ... [12]) and t = 2 (Alon and Frankl [1] and Gy´arf´as [13]). Next we state and prove the Ramsey- type form of our main result, it determines the exact value of...

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

14 311 0
Báo cáo toán hoc:" Anti-Ramsey numbers for graphs with independent cycles Zemin Jin" ppt

Báo cáo toán hoc:" Anti-Ramsey numbers for graphs with independent cycles Zemin Jin" ppt

... 8 Anti-Ramsey numbers for graphs with independent cycles Zemin Jin Department of Mathematics, Zhejiang Normal University Jinhua 321004, P.R. China zeminjin@hotmail.com Xueliang Li Center for ... of anti-Ramsey numbers for Ω k Unlike graphs in the family Ω 2 , we have no more information about graphs in the family Ω k for k ≥ 3. So we cannot treat the family Ω k...

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

8 233 0
Báo cáo toán học: "Another abstraction of the Erd˝s-Szekeres o Happy End Theorem" pot

Báo cáo toán học: "Another abstraction of the Erd˝s-Szekeres o Happy End Theorem" pot

... s 3 ) for all u r ∈ B − {u i , u j }.  We have found the proof of Theorem 1 during the 7th International Colloquium on Graph Theo r y in Hy`eres in September 2005. Another proof of the theorem ... that  N n  = o( N n ).  the electronic journal of combinatorics 17 (2010), #N11 4 Another abstraction of the Erdos-Szekeres Happy End Theorem Noga Alon Ehsan Chiniforo...

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

6 192 0
Báo cáo toán học: "Double-critical graphs and complete minors" pps

Báo cáo toán học: "Double-critical graphs and complete minors" pps

... 10 complete graphs. 2 Notation All graphs considered in this paper are simple and finite. We let n(G) and m(G) denote the order and size of a graph G, respectively. The path, the cycle and the complete ... subset A and B such that the induced graphs G[A] and G[B] are edge-empty and complete, respectively, and, thus, we have a contradiction by Proposition 5.1. Suppose...

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

27 283 0
Báo cáo toán học: "On the Chv´tal-Erd˝s triangle game a o" potx

Báo cáo toán học: "On the Chv´tal-Erd˝s triangle game a o" potx

... otherwise Breaker wins. A particular family of positional games originates from a seminal paper of Chv´atal and Erd˝os [4]. Let P be a monotone graph property. In the biased P -game Maker and Breaker are alternately ... of a fixed graph. Other positional games on graphs that have attracted considerable attention include the diameter game [1], the planarity, colorability, and m...

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

15 227 0
w