Related papers: Uniform hyperfiniteness
Measurement incompatibility--the impossibility of jointly measuring certain quantum observables--is a fundamental resource for quantum information processing. We develop a graph-theoretic framework for quantifying this resource for large…
Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have the same betweenness centrality. We study the properties of…
For any $\gamma>0$, Keevash, Knox and Mycroft constructed a polynomial-time algorithm to determine the existence of perfect matchings in any $n$-vertex $k$-uniform hypergraph whose minimum codegree is at least $n/k+\gamma n$. We prove a…
We discuss some techniques related to equivariant compactifications of uniform spaces and amenability of topological groups. In particular, we give a new proof of a recent result by Glasner and Weiss describing the universal minimal flow of…
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theory, linear programming and combinatorial optimization. Claude Berge made a conjecture about them, that was proved by Chudnovsky, Robertson,…
Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…
We consider bipartite graphs definable in o-minimal structures, in which the edge relation $G$ is a finite union of graphs of certain measure-preserving maps. We establish a fact on the existence of definable matchings with few short…
We provide a quantitative formulation of the equivalence between hyperlinearity and soficity for amenable groups, showing that every hyperlinear approximation to such a group is essentially produced from a sofic approximation. This…
Motivated by the definition of the Gowers uniformity norms, we introduce and study a wide class of norms. Our aim is to establish them as a natural generalization of the $L_p$ norms. We shall prove that these normed spaces share many of the…
For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…
Let $G$ be a graph and let $g, f$ be nonnegative integer-valued functions defined on $V(G)$ such that $g(v) \le f(v)$ and $g(v) \equiv f(v) \pmod{2}$ for all $v \in V(G)$. A $(g,f)$-parity factor of $G$ is a spanning subgraph $H$ such that…
A graph is universally $k$-edge-weightable if for every $k$-element set $Q\subset\mathbb{R}$, it admits a proper $Q$-edge weighting. The settled 1-2-3 conjecture implies that for any arithmetic progression $\{a,b,c\}$, every nice regular…
Perfect colorings (equitable partitions) of graphs are extensively studied, while the same concept for hypergraphs attracts much less attention. The aim of this paper is to develop basic notions and properties of perfect colorings for…
In this paper we study analogues of amenability for topological groups in the context of definable structures. We prove fixed point theorems for such groups. More importantly, we propose definitions for definable actions and continuous…
The Lagrangian density of an $r$-uniform hypergraph $H$ is $r!$ multiplying the supremum of the Lagrangians of all $H$-free $r$-uniform hypergraphs. For an $r$-uniform graph $H$ with $t$ vertices, it is clear that $\pi_{\lambda}(H)\ge…
The {\em overlap number} of a finite $(d+1)$-uniform hypergraph $H$ is defined as the largest constant $c(H)\in (0,1]$ such that no matter how we map the vertices of $H$ into $\R^d$, there is a point covered by at least a $c(H)$-fraction of…
One of the most fundamental questions in graph property testing is to characterize the combinatorial structure of properties that are testable with a constant number of queries. We work towards an answer to this question for the…
We introduce the notions of approximate Connes-amenability and approximate strong Connes-amenability for dual Banach algebras. Then we characterize these two types of algebras in terms of approximate normal virtual diagonals and approximate…
We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…
We introduce the matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree. A…