Related papers: Geometric duality, perfect graphs, and the Sierpi\…
A hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the chordality of a graph $G$ to be the minimum number of…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
We construct an example of a real Banach space whose group of surjective isometries has no uniformly continuous one-parameter semigroups, but the group of surjective isometries of its dual contains infinitely many of them. Other examples…
It is proved that the relation of isomorphism between separable Banach spaces is a complete analytic equivalence relation, i.e., that any analytic equivalence relation Borel reduces to it. Thus, separable Banach spaces up to isomorphism…
The set of factorizations of permutations in to $m$ transpositions of some symmetric group $\mathcal{S}_n$ is naturally in bijection with the set of graphs of order $n$ and size $m$ with both edges and vertices labeled. We define a notion…
A field $K$ is quasi-classical $d$-local if there exist fields $K=k_d,\dots,k_0$ with $k_{i+1}$ Henselian admissible discretely valued with residue field $k_i$, and $k_0$ quasi-finite. We prove a duality theorem for the Galois cohomology of…
A fundamental result in the study of graph homomorphisms is Lov\'asz's theorem that two graphs are isomorphic if and only if they admit the same number of homomorphisms from every graph. A line of work extending Lov\'asz's result to more…
A vertex $v$ of a 2-connected cubic graph $G$ is $\lambda$-matchable if $G$ has a spanning subgraph in which $v$ has degree three whereas every other vertex has degree one, and we let $\lambda(G)$ denote the number of such vertices.…
For a family $\mathcal{F}$ of graphs, a graph $G$ is called \emph{$\mathcal{F}$-universal} if $G$ contains every graph in $\mathcal{F}$ as a subgraph. Let $\mathcal{F}_n(d)$ be the family of all graphs on $n$ vertices with maximum degree at…
A display of a topological group G on a Banach space X is a topological isomorphism of G with the isometry group Isom(X,||.||) for some equivalent norm ||.|| on X, where the latter group is equipped with the strong operator topology.…
Motivated by a conjecture put forward by Abramowicz and Bajtlik we reconsider the twin paradox in static spacetimes. According to a well known theorem in Lorentzian geometry the longest timelike worldline between two given points is the…
A graph $G$ has the Perfect-Matching-Hamiltonian property (PMH-property) if for each one of its perfect matchings, there is another perfect matching of $G$ such that the union of the two perfect matchings yields a Hamiltonian cycle of $G$.…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
Gelfand-Naimark-Stone duality provides an algebraic counterpart of compact Hausdorff spaces in the form of uniformly complete bounded archimedean $\ell$-algebras. In [4] we extended this duality to completely regular spaces. In this article…
Generalizing Duality Theorem of V. V. Fedorchuk, we prove Stone-type duality theorems for the following four categories: all of them have as objects the locally compact Hausdorff spaces, and their morphisms are, respectively, the continuous…
In this paper, we generalize the concept of {\it{perfect graphs}} to other parameters related to graph vertex coloring. This idea was introduced by Christen and Selkow in 1979 and Yegnanarayanan in 2001. Let $ a,b \in \{ \omega, \chi,…
Following a formula found in the paper of Avramov, Iyengar, Lipman, and Nayak (2010) and ideas of Neeman and Khusyairi, we indicate that Grothendieck duality for finite tor-amplitude maps can be developed from scratch via the formula $f^!…
We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…
A dominating set $S$ in a graph $G$ is said to be perfect if every vertex of $G$ not in $S$ is adjacent to just one vertex of $S$. Given a vertex subset $S'$ of a side $P_m$ of an $m\times n$ grid graph $G$, the perfect dominating sets $S$…
Nearly three decades from his celebrated result, we study a modern refinement and strengthening of Kopperman's full metrisabilty of all topological spaces. Within this new theory of \emph{V-spaces}, developed by Flagg and Weiss, we…