Sciweavers

Share
CPC
2007
93views more  CPC 2007»
9 years 10 months ago
On a Random Graph Related to Quantum Theory
We show that a random graph studied by Ioffe and Levit is an example of an inhomogeneous random graph of the type studied by Bollob´as, Janson and Riordan, which enables us to gi...
Svante Janson
CPC
2007
77views more  CPC 2007»
9 years 10 months ago
All Maximum Size Two-Part Sperner Systems: In Short
Harout K. Aydinian, Péter L. Erdös
CPC
2007
105views more  CPC 2007»
9 years 10 months ago
Packing Cliques in Graphs with Independence Number 2
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
Raphael Yuster
CPC
2007
61views more  CPC 2007»
9 years 10 months ago
Maximizing Several Cuts Simultaneously
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
Daniela Kühn, Deryk Osthus
CPC
2007
88views more  CPC 2007»
9 years 10 months ago
Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. G.D. Birkhoff and D.C. Lewis showed that, if G is a plane near triangulation, then the only zeros of...
Bill Jackson
CPC
2007
113views more  CPC 2007»
9 years 10 months ago
Regular Partitions of Hypergraphs: Regularity Lemmas
Abstract. Szemer´edi’s regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques de...
Vojtech Rödl, Mathias Schacht
CPC
2007
72views more  CPC 2007»
9 years 10 months ago
Thresholds and Expectation Thresholds
Jeff Kahn, G. I. L. Kalai
CPC
2007
58views more  CPC 2007»
9 years 10 months ago
Teasing Apart Two Trees
Mike A. Steel, László A. Szék...
CPC
2007
76views more  CPC 2007»
9 years 10 months ago
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
Svante Janson, Joel Spencer
books