Related papers: Expansion of random $0/1$ polytopes

We prove that any mixed-integer linear extended formulation for the matching polytope of the complete graph on $n$ vertices, with a polynomial number of constraints, requires $\Omega(\sqrt{\sfrac{n}{\log n}})$ many integer variables. By…

A $d$-regular graph on $n$ nodes has at most $T_{\max} = \frac{n}{3} \tbinom{d}{2}$ triangles. We compute the leading asymptotics of the probability that a large random $d$-regular graph has at least $c \cdot T_{\max}$ triangles, and…

For a given hypergraph $H$ and a vertex $v\in V(H)$, consider a random matching $M$ chosen uniformly from the set of all matchings in $H.$ In $1995,$ Kahn conjectured that if $H$ is a $d$-regular linear $k$-uniform hypergraph, the…

A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…

Given a graph $G$, the percolated graph $G_p$ has each edge independently retained with probability $p$. Collares, Diskin, Erde, and Krivelevich initiated the study of large structures in percolated single-scale vertex expander graphs,…

Let $\ell \geq 2$ be an integer. For each $\eps >0$ remove from $\R^2$ the union of discs of radius $\eps$ centered at the integer lattice points $(m,n$, with $m\nequiv n\mod{\ell}$. Consider a point-like particle moving linearly at unit…

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

We resolve two conjectures of Hri\v{n}\'{a}kov\'{a}, Knor and \v{S}krekovski (2019) concerning the relationship between the variable Wiener index and variable Szeged index for a connected, non-complete graph, one of which would imply the…

The symmetric edge polytope of a simple graph is a lattice polytope defined as the convex hull of a subset of the type A roots corresponding to the edges of the graph. In this article we prove a sharp lower bound for the number of edges of…

Oliveira conjectured that the order of the mixing time of the exclusion process with $k$-particles on an arbitrary $n$-vertex graph is at most that of the mixing-time of $k$ independent particles. We verify this up to a constant factor for…

A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most…

Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…

We consider the spectral gap of a uniformly chosen random $(d_1,d_2)$-biregular bipartite graph $G$ with $|V_1|=n, |V_2|=m$, where $d_1,d_2$ could possibly grow with $n$ and $m$. Let $A$ be the adjacency matrix of $G$. Under the assumption…

In this paper, we prove the conjectures of Gharakhloo and Welker (2023) that the positive matching decomposition number (pmd) of a $3$-uniform hypergraph is bounded from above by a polynomial of degree $2$ in terms of the number of…

We show that the dissipative Abelian sandpile on a graph L can be related to a random walk on a graph which consists of L extended with a trapping site. From this relation it can be shown, using exact results and a scaling assumption, that…

Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the…

Christoph, Dragani\'{c}, Gir\~{a}o, Hurley, Michel, and M\"{u}yesser conjectured that, when $d\mid n$, the expected number of cycles in a uniformly random cycle-factor of a directed $d$-regular graph on $n$ vertices is uniquely maximised by…

Consider a (not necessarily near-critical) random graph running in continuous time. A recent breadth-first-walk construction is extended in order to account for the surplus edge data in addition to the spanning edge data. Two different…

The 1-2-3 Conjecture, introduced by Karo\'nski, {\L}uczak, and Thomason in 2004, was recently solved by Keusch. This implies that, for any connected graph $G$ different from $K_2$, we can turn $G$ into a locally irregular multigraph $M(G)$,…

In 2004, Karo\'nski, \L uczak and Thomason proposed $1$-$2$-$3$-conjecture: For every nice graph $G$ there is an edge weighting function $ w:E(G)\rightarrow\{1,2,3\} $ such that the induced vertex coloring is proper. After that, the total…