Related papers: The Regularity Lemma with bounded VC Dimension
Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…
Lehel conjectured that in every $2$-coloring of the edges of $K_n$, there is a vertex disjoint red and blue cycle which span $V(K_n)$. \L uczak, R\"odl, and Szemer\'edi proved Lehel's conjecture for large $n$, Allen gave a different proof…
We prove that for each integer $r\geq 2$, there exists a constant $C_r>0$ with the following property: for any $0<\varepsilon \leq 1/2$ and any graph $G$ with clique number at most $r,$ there is a partition of $V(G)$ into at most…
The problem of inferring the distribution of a random vector given that its norm is large requires modeling a homogeneous limiting density. We suggest an approach based on graphical models which is suitable for high-dimensional vectors. We…
Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…
Given $\varepsilon>0$, there exists $f_0$ such that, if $f_0 \le f \le \Delta^2+1$, then for any graph $G$ on $n$ vertices of maximum degree $\Delta$ in which the neighbourhood of every vertex in $G$ spans at most $\Delta^2/f$ edges, (i) an…
We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…
We establish existence and regularity results for boundary value problems arising from the first variation of the Willmore energy in the graphical setting. Our focus lies on two-dimensional surfaces with fixed clamped boundary conditions,…
The notion of robust expansion has played a central role in the solution of several conjectures involving the packing of Hamilton cycles in graphs and directed graphs. These and other results usually rely on the fact that every robustly…
We prove the validity of the $\varepsilon-\varepsilon^\beta$ property in the isoperimetric problem with double density, generalising the known properties for the case of single density. As a consequence, we derive regularity for…
The triangle removal states that if $G$ contains $\varepsilon n^2$ edge-disjoint triangles, then $G$ contains $\delta(\varepsilon)n^3$ triangles. Unfortunately, there are no sensible bounds on the order of growth of $\delta(\varepsilon)$,…
We prove a version of Szemeredi's regularity lemma for subsets of a typical random set in F_p^n. As an application, a result on the distribution of three-term arithmetic progressions in sparse sets is discussed.
We study a notion of VC-dimension for subsets of groups, defining this for a set $A$ to be the VC-dimension of the family $\{ (xA) \cap A : x \in A\cdot A^{-1} \}$. We show that if a finite subset $A$ of an abelian group has bounded…
Reed's well-known $\omega$, $\Delta$, $\chi$ conjecture proposes that every graph satisfies $\chi \leq \lceil \frac 12(\Delta+1+\omega)\rceil$. The second author formulated a {\em local strengthening} of this conjecture that considers a…
In this paper, we prove local $C^{1}$ regularity of free boundaries for the double obstacle problem with an upper obstacle $\psi$, \begin{align*} \Delta u &=f\chi_{\Omega(u) \cap\{ u< \psi\} }+ \Delta \psi \chi_{\Omega(u)\cap \{u=\psi\}},…
We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…
We formulate a generalization of the volume conjecture for planar graphs. Denoting by <G, c> the Kauffman bracket of the graph G whose edges are decorated by real "colors" c, the conjecture states that, under suitable conditions, certain…
Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e. random graphs…
We consider {\em monotone} embeddings of a finite metric space into low dimensional normed space. That is, embeddings that respect the order among the distances in the original space. Our main interest is in embeddings into Euclidean…
It is proved that with finitely many possible exceptions, each cyclotomic scheme over finite field is determined up to isomorphism by the tensor of 2-dimensional intersection numbers; for infinitely many schemes, this result cannot be…