English
Related papers

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

200 papers

In this note, we investigate the algebraic and topological representation theory of cylindric ortholattices and cylindric Boolean algebras. The first contribution demonstrates that cylindric ortholattices are closed under canonical…

Logic · Mathematics 2025-07-24 Joseph McDonald

A class of graphs is $\chi$-bounded if there is a function $f$ such that $\chi(G)\le f(\omega(G))$ for every induced subgraph $G$ of every graph in the class, where $\chi,\omega$ denote the chromatic number and clique number of $G$…

Combinatorics · Mathematics 2019-03-15 Alex Scott , Paul Seymour

We characterize those algebras over a disconnected uniformly complete topological field which are representable as algebras of continuous functions on compact topological spaces, generalizing thus Gelfand duality for non-archimedean normed…

General Topology · Mathematics 2025-10-09 Sebastián Rodríguez , Xavier Caicedo

We show that among compact subsets of the plane which are drawings of linear graphs, two sets $\sigma$ and $\tau$ are homeomorphic if and only if the corresponding spaces of absolutely continuous functions (in the sense of Ashton and Doust)…

Functional Analysis · Mathematics 2021-05-31 Shaymaa Al-shakarchi , Ian Doust

We study the double iterated outer $L^p$ spaces, namely the outer $L^p$ spaces associated with three exponents and defined on sets endowed with a measure and two outer measures. We prove that in the case of finite sets, under certain…

Classical Analysis and ODEs · Mathematics 2023-12-05 Marco Fraccaroli

We show that for a metric space with an even number of points there is a 1-Lipschitz map to a tree-like space with the same matching number. This result gives the first basic version of an unoriented Kantorovich duality. The study of the…

Metric Geometry · Mathematics 2016-09-22 Mircea Petrache , Roger Züst

Let $G$ be a countable graph containing a copy of the countable random graph (Erd\H{o}s-R\'enyi graph, Rado graph), $Emb (G)$ the monoid of its self-embeddings, ${\mathbb P} (G)=\{f[G]: f\in Emb (G)\}$ the set of copies of $G$ contained in…

Logic · Mathematics 2017-09-26 Miloš S. Kurilić , Stevo Todorčević

For finite graphs $G$ and $H$, let $\RR(G,H)$ denote the isomorphism classes of Ramsey-minimal graphs for $(G,H)$. We prove two 1981 conjectures of Burr, Erd\H{o}s, Faudree, Rousseau, and Schelp: Ramsey-finiteness is preserved by adjoining…

Combinatorics · Mathematics 2026-05-06 Yaping Mao

For a Banach space $X$, we show that any family of graphs quasi-isometric to levels of a warped cone $\mathcal O_\Gamma Y$ is an expander with respect to $X$ if and only if the induced $\Gamma$-representation on $L^2(Y;X)$ has a spectral…

Metric Geometry · Mathematics 2021-04-21 Damian Sawicki

This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contains a subgraph that is isomorphic to a specified graph H.…

Combinatorics · Mathematics 2025-05-23 Igal Sason

We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…

Combinatorics · Mathematics 2011-06-08 Reinhard Diestel , Julian Pott

In 1924, S. Banach and A. Tarski proved an astonishing, yet rather counterintuitive paradox: given a solid ball in $\mathbb{R}^3$, it is possible to partition it into finitely many pieces and reassemble them to form two solid balls, each…

History and Overview · Mathematics 2022-06-01 Katie Buchhorn

We prove that a certain bilinear pairing (analagous to the Poincare-Lefschetz intersection pairing) between filtered sub- and quotient complexes of a Floer-type chain complex and of its "opposite complex" is always nondegenerate on…

Symplectic Geometry · Mathematics 2011-01-27 Michael Usher

Let $G$ be a group which is either virtually soluble or virtually free, and let $\omega$ be a weight on $G$. We prove that, if $G$ is infinite, then there is some maximal left ideal of finite codimension in the Beurling algebra $\ell^1(G,…

Functional Analysis · Mathematics 2023-06-21 Jared T. White

We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…

Combinatorics · Mathematics 2015-09-15 Peter Keevash , Richard Mycroft

We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurable perfect matching if it is one-ended or the degree is odd.…

Combinatorics · Mathematics 2022-07-01 Matthew Bowen , Gabor Kun , Marcin Sabok

The super-neighborhood of a vertex set $A$ in a graph $G$, denoted by $\Lambda^2(A)$, is the set of vertices adjacent to at least two vertices in $A$. We say that a bipartite graph $G=(X, Y)$ with $|X| \geq 2$ satisfies the double Hall…

Combinatorics · Mathematics 2025-08-26 Guantao Chen , Mikhail Lavrov , Yuying Ma , Yimo Su , Jennifer Vandenbussche

For a real normed space $X$, we study the $n$-dual space of $\left(X,\left\Vert \cdot \right\Vert \right) $ and show that the space is a Banach space. Meanwhile, for a real normed space $X$ of dimension $d\geq n$ which satisfies property…

Functional Analysis · Mathematics 2015-12-08 Yosafat E. P. Pangalela

We consider a random geometric graph model, where pairs of vertices are points in a metric space and edges are formed independently with fixed probability $p$ between pairs within threshold distance $\delta $. A countable dense set in a…

Combinatorics · Mathematics 2018-02-22 Anthony Bonato , Jeannette Janssen , Anthony Quas

We show that the ratio of the number of near perfect matchings to the number of perfect matchings in $d$-regular strong expander (non-bipartite) graphs, with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markov chain…

Data Structures and Algorithms · Computer Science 2021-03-17 Farzam Ebrahimnejad , Ansh Nagda , Shayan Oveis Gharan
‹ Prev 1 3 4 5 6 7 10 Next ›