Related papers: Geometric duality, perfect graphs, and the Sierpi\…
Lov\'asz and Plummer conjectured, in the mid 1970's, that every cubic graph G with no cutedge has an exponential in |V(G)| number of perfect matchings. In this work we show that every cubic planar graph G whose geometric dual graph is a…
This paper will generalize what may be termed the "geometric duality theory" of real pre-ordered Banach spaces which relates geometric properties of a closed cone in a real Banach space, to geometric properties of the dual cone in the dual…
We show that under a certain topological assumption on two compact hereditary families $\F$ and $\G$ on some infinite cardinal $\kappa$, the corresponding combinatorial spaces $X_\F$ and $X_\G$ are isometric if and only if there is a…
We determine the distribution of the sandpile group (also known as the Jacobian) of the Erd\H{o}s-R\'{e}nyi random graph $G(n,q)$ along with its canonical duality pairing as $n$ tends to infinity, fully resolving a conjecture from 2015 due…
We show that there exists only one duality pair for ordered graphs. We will also define a corresponding definition of $\chi^<$-boundedness for ordered graphs and show that all ordered graphs are $\chi^<$-bounded and prove an analogy of…
In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…
Let $G$ be a locally compact second countable groupoid with a fixed Haar system $\lambda=\{\lambda^{u}\}_{u\in G^{0}}$ and $(\Phi,\Psi)$ be a complementary pair of $N$-functions satisfying $\Delta_{2}$-condition. In this article, we…
Consider the random process in which the edges of a graph $G$ are added one by one in a random order. A classical result states that if $G$ is the complete graph $K_{2n}$ or the complete bipartite graph $K_{n,n}$, then typically a perfect…
We introduce and study a notion of duality for two classes of optimization problems commonly occurring in probability theory. That is, on an abstract measurable space $(\Omega,\mathcal{F})$, we consider pairs $(E,\mathcal{G})$ where $E$ is…
We study delta-points in Banach spaces $h_{\mathcal{A},p}$ generated by adequate families $\mathcal A$ where $1 \le p < \infty$. In the case the familiy $\mathcal A$ is regular and $p=1,$ these spaces are known as combinatorial Banach…
A graph is {\em perfect} if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of perfect graphs include bipartite graphs, line graphs of bipartite graphs and the complements of such…
A graph $G$ with a perfect matching is called saturated if $G+e$ has more perfect matchings than $G$ for any edge $e$ that is not in $G$. Lov\'asz gave a characterization of the saturated graphs called the cathedral theorem, with some…
This paper studies topological duals of Banach function spaces (BFS). We assume a finite measure but our arguments extend to general locally convex function spaces whose topology is generated by seminorms that satisfy the usual BFS axioms.…
In this paper we prove, as conjectured by B.Banachewski and C.J.Mulvey, that the constructive Gelfand duality can be extended into a duality between compact regular locales and unital abelian localic C*-algebras. In order to do so we…
We characterize separable Banach spaces having $G_\delta$ isometry classes in the Polish codings $\mathcal{P}$, $\mathcal{P}_\infty$ and $\mathcal{B}$ introduced by C\'uth-Dole\v{z}al-Doucha-Kurka [13] as those being guarded Fra\"iss\'e, a…
We extend Yosida's 1941 version of Stone-Gelfand duality to metrically complete unital lattice-ordered groups that are no longer required to be real vector spaces. This calls for a generalised notion of compact Hausdorff space whose points…
In 1965, Erd\H{o}s and P\'{o}sa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold for odd cycles, and Dejter…
Interaction between clique number $\omega(G) $ and chromatic number $\chi(G) $ of a graph is a well studied topic in graph theory. Perfect Graph Theorems are probably the most important results in this direction. Graph $G$ is called…
We introduce and study the problem \mpd, which asks for two planar graphs $G_1$ and $G_2$ whether $G_1$ can be embedded such that its dual is isomorphic to $G_2$. Our algorithmic main result is an NP-completeness proof for the general case…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…