Size reconstructibility of graphs

The deck of a graph $G$ is given by the multiset of (unlabelled) subgraphs $\{G-v:v\in V(G)\}$. The subgraphs $G-v$ are referred to as the cards of $G$. Brown and Fenner recently showed that, for $n\geq29$, the number of edges of a graph $G$ can be computed from any deck missing 2 cards. We show that, for sufficiently large $n$, the number of edges can be computed from any deck missing at most $\frac1{20}\sqrt{n}$ cards.Comment: 15 page

Graph Treewidth and Geometric Thickness Parameters

Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter "thickness". By restricting the edges to be straight, we obtain the "geometric thickness". By further restricting the vertices to be in convex position, we obtain the "book thickness". This paper studies the relationship between these parameters and treewidth. Our first main result states that for graphs of treewidth $k$, the maximum thickness and the maximum geometric thickness both equal $\lceil{k/2}\rceil$. This says that the lower bound for thickness can be matched by an upper bound, even in the more restrictive geometric setting. Our second main result states that for graphs of treewidth $k$, the maximum book thickness equals $k$ if $k \leq 2$ and equals $k+1$ if $k \geq 3$. This refutes a conjecture of Ganley and Heath [Discrete Appl. Math. 109(3):215-221, 2001]. Analogous results are proved for outerthickness, arboricity, and star-arboricity.Comment: A preliminary version of this paper appeared in the "Proceedings of the 13th International Symposium on Graph Drawing" (GD '05), Lecture Notes in Computer Science 3843:129-140, Springer, 2006. The full version was published in Discrete & Computational Geometry 37(4):641-670, 2007. That version contained a false conjecture, which is corrected on page 26 of this versio

Inclusive One Jet Production With Multiple Interactions in the Regge Limit of pQCD

DIS on a two nucleon system in the regge limit is considered. In this framework a review is given of a pQCD approach for the computation of the corrections to the inclusive one jet production cross section at finite number of colors and discuss the general results.Comment: 4 pages, latex, aicproc format, Contribution to the proceedings of "Diffraction 2008", 9-14 Sep. 2008, La Londe-les-Maures, Franc

On gauge-invariant Green function in 2+1 dimensional QED

Both the gauge-invariant fermion Green function and gauge-dependent conventional Green function in $2+1$ dimensional QED are studied in the large $N$ limit. In temporal gauge, the infra-red divergence of gauge-dependent Green function is found to be regulariable, the anomalous dimension is found to be $\eta= \frac{64}{3 \pi^{2} N}$. This anomalous dimension was argued to be the same as that of gauge-invariant Green function. However, in Coulomb gauge, the infra-red divergence of the gauge-dependent Green function is found to be un-regulariable, anomalous dimension is even not defined, but the infra-red divergence is shown to be cancelled in any gauge-invariant physical quantities. The gauge-invariant Green function is also studied directly in Lorentz covariant gauge and the anomalous dimension is found to be the same as that calculated in temporal gauge.Comment: 8 pages, 6 figures, to appear in Phys. Rev.

The Alexander-Orbach conjecture holds in high dimensions

We examine the incipient infinite cluster (IIC) of critical percolation in regimes where mean-field behavior has been established, namely when the dimension d is large enough or when d>6 and the lattice is sufficiently spread out. We find that random walk on the IIC exhibits anomalous diffusion with the spectral dimension d_s=4/3, that is, p_t(x,x)= t^{-2/3+o(1)}. This establishes a conjecture of Alexander and Orbach. En route we calculate the one-arm exponent with respect to the intrinsic distance.Comment: 25 pages, 2 figures. To appear in Inventiones Mathematica

Genetic variation of wild and hatchery populations of the catla Indian major carp (Catla catla Hamilton 1822: Cypriniformes, Cyprinidae) revealed by RAPD markers

Genetic variation is a key component for improving a stock through selective breeding programs. Randomly amplified polymorphic DNA (RAPD) markers were used to assess genetic variation in three wild population of the catla carp (Catla catla Hamilton 1822) in the Halda, Jamuna and Padma rivers and one hatchery population in Bangladesh. Five decamer random primers were used to amplify RAPD markers from 30 fish from each population. Thirty of the 55 scorable bands were polymorphic, indicating some degree of genetic variation in all the populations. The proportion of polymorphic loci and gene diversity values reflected a relatively higher level of genetic variation in the Halda population. Sixteen of the 30 polymorphic loci showed a significant (p < 0.05, p < 0.01, p < 0.001) departure from homogeneity and the FST values in the different populations indicated some degree of genetic differentiation in the population pairs. Estimated genetic distances between populations were directly correlated with geographical distances. The unweighted pair group method with averages (UPGMA) dendrogram showed two clusters, the Halda population forming one cluster and the other populations the second cluster. Genetic variation of C. catla is a useful trait for developing a good management strategy for maintaining genetic quality of the species

Amenability of groups and GG-sets

This text surveys classical and recent results in the field of amenability of groups, from a combinatorial standpoint. It has served as the support of courses at the University of G\"ottingen and the \'Ecole Normale Sup\'erieure. The goals of the text are (1) to be as self-contained as possible, so as to serve as a good introduction for newcomers to the field; (2) to stress the use of combinatorial tools, in collaboration with functional analysis, probability etc., with discrete groups in focus; (3) to consider from the beginning the more general notion of amenable actions; (4) to describe recent classes of examples, and in particular groups acting on Cantor sets and topological full groups

Generalized ramsey theory for graphs, I. Diagonal numbers

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/43187/1/10998_2005_Article_BF02018466.pd