相关论文: How is a graph like a manifold?
We show equivalences between several high-dimensional problems in extremal combinatorics and parallel repetition of multiplayer (multiprover) games over large answer alphabets. This extends the forbidden-subgraph technique, previously…
In this paper three unrelated problems will be discussed. What connects them is the rich methodology of classical probability theory. In the first two problems we have a complete answer to the problems raised; in the third case, what we…
In this Note, we present recent developments in the Renormalization Theory of quadratic polynomials and discuss their applications, with an emphasis on the MLC conjecture, the problem of local connectivity of the Mandelbrot set, and on its…
A quasisymmetric graph is a curve whose projection onto a line is a quasisymmetric map. We show that this class of curves is related to solutions of the reduced Beltrami equation and to a generalization of the Zygmund class $\Lambda_*$.…
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a…
Consider a graph obtained by taking edge disjoint union of $k$ complete bipartite graphs. Alon, Saks and Seymour conjectured that such graph has chromatic number at most $k+1$. This well known conjecture remained open for almost twenty…
In this paper, we study random instances of the classical marginal problem. We encode the problem in a graph, where the vertices have assigned fixed binary probability distributions, and edges have assigned random bivariate distributions…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
We show how the theory of tangles is equivalent to that of well-connected tangles. These are drawn on a surface with boundary, and equivalent via Reidemeister moves of a restricted kind. This reworking of the graphical foundations for link…
In 1984, Winkler conjectured that every simple Venn diagram with $n$ curves can be extended to a simple Venn diagram with $n+1$ curves. His conjecture is equivalent to the statement that the dual graph of any simple Venn diagram has a…
This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…
For an integer $m\geq 1$, a combinatorial manifold $\widetilde{M}$ is defined to be a geometrical object $\widetilde{M}$ such that for $\forall p\in\widetilde{M}$, there is a local chart $(U_p,\phi_p)$ enable $\phi_p:U_p\to…
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It shows an equivalence between regular graphs and graphs for which a sequence of invariants presents some symmetric property. We extend this…
We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…
The scissors congruence conjecture for the unimodular group is an analogue of Hilbert's third problem, for the equidecomposability of polytopes. Liu and Osserman studied the Ehrhart quasi-polynomials of polytopes naturally associated to…
We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…
We give conjectures on the possible graded Betti numbers of Cohen-Macaulay modules up to multiplication by positive rational numbers. The idea is that the Betti diagrams should be non-negative linear combinations of pure diagrams. The…
We consider a classical N. Steenrod's problem on realization of homology classes by images of the fundamental classes of manifolds. It is well-known that each integral homology class can be realized with some multiplicity as an image of the…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
In this paper Legendrian graphs in $(\mathbb{R}^3,\xi_{\mathrm{st}})$ are considered modulo Legendrian isotopy and edge contraction. To a Legendrian graph we associate a (generalized) rectangular diagram --- a purely combinatorial object.…