Related papers: Geometric duality, perfect graphs, and the Sierpi\…

Diamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families of graphs are parallel to each other, for example…

In this article, using ideas of Liero, Mielke and Savar\'{e} in [21], we establish a Kantorovich duality for generalized Wasserstein distances $W_1^{a,b}$ on a generalized Polish metric space, introduced by Picolli and Rossi. As a…

The duality theorem of Lass relates the matching polynomials of a simple graph $G$ with the matching polynomials of its complement $\bar G$. In particular, this relation gives rise to Godsil's result, which offers a nice interpretation of…

In this paper, for each graph G, a free edge set F is defined. To study the existence of cycle double cover, the naive cycle double cover of G and F have been defined and studied. In the main theorem, the paper, based on the Kuratowski…

Let $G$ be a graph of even order and let $K_{G}$ be the complete graph on the same vertex set of $G$. A pairing of a graph $G$ is a perfect matching of the graph $K_{G}$. A graph $G$ has the Pairing-Hamiltonian property (for short, the…

We prove a homology vanishing theorem for graphs with positive Bakry-\'Emery curvature, analogous to a classic result of Bochner on manifolds \cite{Bochner}. Specifically, we prove that if a graph has positive curvature at every vertex,…

We give a uniform and self-contained proof that if $G$ is a connected graph with $\chi(G) = \Delta(G)$ and $G\neq \overline{C_7}$, then $G$ contains either $K_{\Delta(G)}$ or an odd hole where every vertex has degree at least $\Delta(G)-1$…

In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…

Given a family of subspaces we investigate existence, quantity and quality of common complements in Hilbert spaces and Banach spaces. In particular we are interested in complements for countable families of closed subspaces of finite…

We prove that a fractional perfect matching in a non-bipartite graph can be written, in polynomial time, as a convex combination of perfect matchings. This extends the Birkhoff-von Neumann Theorem from bipartite to non-bipartite graphs. The…

We prove that both multiple Rademacher system and Rademacher chaos possess the property of random unconditional convergence in the space $L_\infty$. This fact combined with some intimate connections between $L_\infty$-norms of linear…

We extend the notion of self-duality to spaces built from a set of representations of the Lorentz group with bosonic or fermionic behaviour, not having the traditional spin-one upper-bound of super Minkowski space. The generalized…

The classical random graph model $G(n,\lambda/n)$ satisfies a `duality principle', in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved…

The purpose of this article is to generalize some known characterizations of Banach space properties in terms of graph preclusion. In particular, it is shown that superreflexivity can be characterized by the non-equi-bi-Lipschitz…

We show that every graph with twin-width $t$ has chromatic number $O(\omega ^{k_t})$ for some integer $k_t$, where $\omega$ denotes the clique number. This extends a quasi-polynomial bound from Pilipczuk and Soko{\l}owski and generalizes a…

Let $\mathcal{P}$ be a class of Banach spaces and let $T=\{T_\alpha\}_{\alpha\in A}$ be a set of metric spaces. We say that $T$ is a set of {\it test-spaces} for $\mathcal{P}$ if the following two conditions are equivalent: (1)…

Given a map $f \colon E \longrightarrow F$ between Banach spaces (or Banach lattices), a set $A$ of $E$-valued bounded sequences, ${\bf x} \in A$ and a vector topology $\tau$ on $F$, we investigate the existence of an infinite dimensional…

The complete double vertex graph $M_2(G)$ of $G$ is defined as the graph whose vertices are the $2$-multisubsets of $V(G)$, and two of such vertices are adjacent in $M_2(G)$ if their symmetric difference (as multisets) is a pair of adjacent…

We develop a conformal duality for spacelike graphs in Riemannian and Lorentzian three-manifolds that admit a Riemannian submersion over a Riemannian surface whose fibers are the integral curves of a Killing vector field, which is timelike…

Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial…