English
Related papers

Related papers: On endomorphism universality of sparse graph class…

200 papers

It was shown by Grohe et al. that nowhere dense classes of graphs admit sparse neighbourhood covers of small degree. We show that a monotone graph class admits sparse neighbourhood covers if and only if it is nowhere dense. The existence of…

Our main observation is that the contravariant functor Spec on the category of commutative monoids is representable. We discuss a few consequences of this fact. In particular, we give an efficient way of calculating the Spec(M) of a…

Algebraic Geometry · Mathematics 2012-07-17 Ilia Pirashvili

Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…

Combinatorics · Mathematics 2022-08-17 Maximilian Gorsky , Raphael Steiner , Sebastian Wiederrecht

Let $\Lambda$ be a finite-dimensional associative algebra. The torsion classes of $mod\, \Lambda$ form a lattice under containment, denoted by $tors\, \Lambda$. In this paper, we characterize the cover relations in $tors\, \Lambda$ by…

Representation Theory · Mathematics 2017-10-25 Emily Barnard , Andrew T. Carroll , Shijie Zhu

We prove EPPA (extension property for partial automorphisms) for all antipodal classes from Cherlin's list of metrically homogeneous graphs, thereby answering a question of Aranda et al. This paper should be seen as the first application of…

Combinatorics · Mathematics 2021-06-03 Matěj Konečný

This paper develops the fundamentals of modular representation theory for finite monoids, introducing the decomposition matrix and exploring its connection to Brauer characters. We define modular characteristic and explain how the…

Representation Theory · Mathematics 2023-07-11 Benjamin Steinberg

Let A be an evolution algebra (possibly infinite-dimensional) equipped with a fixed natural basis B, and let E be the associated graph defined by Elduque and Labra. We describe the group of automorphisms of A that are diagonalizable with…

We discover new hereditary classes of graphs that are minimal (with respect to set inclusion) of unbounded clique-width. The new examples include split permutation graphs and bichain graphs. Each of these classes is characterised by a…

Combinatorics · Mathematics 2023-01-31 A. Atminas , R. Brignall , V. Lozin , J. Stacho

A topological monoid is isomorphic to an endomorphism monoid of a countable structure if and only if it is separable and has a compatible complete ultrametric such that composition from the left is non-expansive. We also give a topological…

Logic · Mathematics 2018-10-16 Manuel Bodirsky , Friedrich Martin Schneider

Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…

Logic in Computer Science · Computer Science 2023-11-28 Jan Dreier , Nikolas Mählmann , Sebastian Siebertz , Szymon Toruńczyk

It is shown that the multiplicative monoids of Brauer's centralizer algebras generated out of the basis are isomorphic to monoids of endomorphisms in categories where an endofunctor is adjoint to itself, and where, moreover, a kind of…

Category Theory · Mathematics 2011-09-13 K. Dosen , Z. Petric

We show that in any symmetric monoidal category, if a weight for colimits is absolute, then the resulting colimit of any diagram of dualizable objects is again dualizable. Moreover, in this case, if an endomorphism of the colimit is induced…

Category Theory · Mathematics 2014-07-01 Kate Ponto , Michael Shulman

A subgraph-universal graph/a topological minor-universal graph in a class of graphs $\mathcal{G}$ is a graph in $\mathcal{G}$ which contains every graph in $\mathcal{G}$ as a subgraph/topological minor. We prove that the class $\mathcal{P}$…

Combinatorics · Mathematics 2023-05-30 Thilo Krill

We study monoids generated by various combinations of idempotents and one- or two-sided units of an infinite partial Brauer monoid. This yields a total of eight such monoids, each with a natural characterisation in terms of relationships…

Group Theory · Mathematics 2019-06-24 James East

We define a class of monoidal categories whose morphisms are diagrams, and which are enhancements and generalisations of the Brauer category obtained by adjoining infinitesimal braids, "coupons" and poles. Properties of these categories are…

Representation Theory · Mathematics 2024-04-02 Gustav Lehrer , Ruibin Zhang

We generalize the notion of graph minors to all (finite) simplicial complexes. For every two simplicial complexes H and K and every nonnegative integer m, we prove that if H is a minor of K then the non vanishing of Van Kampen's obstruction…

Combinatorics · Mathematics 2015-06-24 Eran Nevo

We show that if a subsemigroup $S$ of the bicyclic monoid ${\mathscr{C}}(p,q)$ contains infinitely many idempotents then $S$ admits only the discrete Hausdorff shift-continuous topology. Also we proof that every right-continuous…

Group Theory · Mathematics 2026-01-06 Adriana Chornenka , Oleg Gutik

The C-Planarity problem asks for a drawing of a $\textit{clustered graph}$, i.e., a graph whose vertices belong to properly nested clusters, in which each cluster is represented by a simple closed region with no edge-edge crossings, no…

Data Structures and Algorithms · Computer Science 2018-03-16 Giordano Da Lozzo , David Eppstein , Michael T. Goodrich , Siddharth Gupta

This note studies the Burnside problem for homeomorphism groups of compact connected manifolds. For surfaces, we prove that the identity component of the homeomorphism group is torsion-free precisely when the surface is not the sphere,…

Geometric Topology · Mathematics 2026-04-24 Donggyun Seo

The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity to hypergraphs whose hyperedges of size at least four are…

Combinatorics · Mathematics 2025-08-26 Marco Caoduro , Meike Neuwohner , Joseph Paat
‹ Prev 1 8 9 10 Next ›