Related papers: Combinatorial approach to the interpolation method…

In the $d$-Scattered Set problem we are asked to select at least $k$ vertices of a given graph, so that the distance between any pair is at least $d$. We study the problem's (in-)approximability and offer improvements and extensions of…

We develop three approaches of combinatorial flavour to study the structure of minimal codes and cutting blocking sets in finite geometry, each of which has a particular application. The first approach uses techniques from algebraic…

We consider the Eschenauer-Gligor key predistribution scheme under the condition of partial visibility with i.i.d. on-off links between pairs of nodes. This situation is modeled as the intersection of two random graphs, namely a random key…

In this work, we propose a large-graph limit estimate of the matching coverage for several matching algorithms, on general graphs generated by the configuration model. For a wide class of {\em local} matching algorithms, namely, algorithms…

We demonstrate, with a concrete example, how the combinatorial approach to a general system of particles, which was introduced in detail in the earlier paper arXiv:1205.4986, works and where it enters to provide a genuine extension of…

We give a combinatorial algorithm for computing exact maximum flows in directed graphs with $n$ vertices and edge capacities from $\{1,\dots,U\}$ in $\tilde{O}(n^{2}\log U)$ time, which is near-optimal on dense graphs. This shaves an…

Let $G = (V,E)$ be a graph, and for each $e \in E(G)$, let $L_e$ be a list of real numbers. Let $w:E(G) \to \cup_{e \in E(G)}L_e$ be an edge weighting function such that $w(e) \in L_e$ for each $e \in E(G)$, and let $c_w$ be the vertex…

In recent work (Pandit and Kulkarni [Discrete Applied Mathematics, 244 (2018), pp. 155--169]), the independence number of a graph was characterized as the maximum of the $\ell_1$ norm of solutions of a Linear Complementarity Problem (\LCP)…

We provide an explicit formula for the limiting free energy density (log-partition function divided by the number of vertices) for ferromagnetic Potts models on uniformly sparse graph sequences converging locally to the d-regular tree for d…

Half graphs and their variants, such as ladders, semi-ladders and co-matchings, are combinatorial objects that encode total orders in graphs. Works by Adler and Adler (Eur. J. Comb.; 2014) and Fabia\'nski et al. (STACS; 2019) prove that in…

This paper investigates the asymptotic behavior of the Helmholtz free energy of mixtures at small compressibility. We start from a general representation for the local free energy that is valid in stable subregions of the phase diagram. On…

Motivated by applications, the last few years have witnessed tremendous interest in understanding the structure as well as the behavior of dynamics for inhomogeneous random graph models. In this study we analyze the maximal components at…

We study cumulants of numbers of $q$-step walks on Erd\"os-R\'enyi-type random graphs of long-range percolation radius model in the limit when the number of vertices $N$, concentration $c$, and the interaction radius $R$ tend to infinity.…

We consider the free energy of the bipartite spherical Sherrington--Kirkpatrick model. We find the critical temperature and prove the limiting free energy for all non-critical temperature. We also show that the law of the fluctuation of the…

Let $\mathcal{C}$ and $\mathcal{D}$ be hereditary graph classes. Consider the following problem: given a graph $G\in\mathcal{D}$, find a largest, in terms of the number of vertices, induced subgraph of $G$ that belongs to $\mathcal{C}$. We…

We present the diagrammatic technique for calculating the free energy of the matrix eigenvalue model (the model with arbitrary power $\beta$ by the Vandermonde determinant) to all orders of 1/N expansion in the case where the limiting…

When studying networks using random graph models, one is sometimes faced with situations where the notion of adjacency between nodes reflects multiple constraints. Traditional random graph models are insufficient to handle such situations.…

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

We study the following question: given a massive Markov random field on $n$ nodes, can a small sample from it provide a rough approximation to the free energy $\mathcal{F}_n = \log{Z_n}$? Results in graph limit literature by Borgs, Chayes,…

Let $G=(V,E)$ be a finite, connected graph. We investigate a notion of boundary $\partial G \subseteq V$ and argue that it is well behaved from the point of view of potential theory. This is done by proving a number of discrete analogous of…