Related papers: Structural properties and characterizations of $\m…

A lifting of a semilattice S is an algebra A such that the semilattice of compact (=finitely generated) congruences of A is isomorphic to S. The aim of this work is to give a categorical theory of partial algebras endowed with a partial…

In this research, we determine the structure of (claw, bull)-free graphs. We show that every connected (claw, bull)-free graph is either an expansion of a path, an expansion of a cycle, or the complement of a triangle-free graph; where an…

We examine indivisibility for classes of graphs. We show that the class of hereditarily $\alpha$-sparse graphs is indivisible if and only if $\alpha > 2$. Additionally, we show that the following classes of graphs are indivisible: perfect…

Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random graphs has received much attention in contexts as diverse…

We introduce a family of forcing notions that are helpful in showing that certain graphs do not have countable colourings of (additive) Borel class alpha. We construct graphs that are ''weakly minimal'' for such colourings.

After some definitions, we review in the first part of this talk the construction and classification of classical $W$ (super)algebras symmetries of Toda theories. The second part deals with more recently obtained properties. At first, we…

In this paper we give two characterizations of the $p \times q$-grid graphs as co-edge-regular graphs with four distinct eigenvalues.

We consider circulant graphs having $p$ vertices, with $p$ prime. To any such graph we associate a certain number $k$, that we call type of the graph. We prove that for $p>>k$ the graph has no quantum symmetry, in the sense that the quantum…

Recently, there have been found new relations between the zero forcing number and the minimum rank of a graph with the algebraic co-rank. We continue on this direction by giving a characterization of the graphs with real algebraic co-rank…

We present a classification of characteristic Dynkin diagrams for the $A_N$, $B_N$, $C_N$ and $D_N$ algebras. This classification is related to the classification of \cw(\cg,\ck) algebras arising from non-Abelian Toda models, and we argue…

Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions. The corresponding…

This paper considers the problem of defining distributions over graphical structures. We propose an extension of the hyper Markov properties of Dawid and Lauritzen [Ann. Statist. 21 (1993) 1272-1317], which we term structural Markov…

We continue the study of Carleman-Sobolev classes from previous joint work with G. Behm. We consider spaces denoted by $W_\mathcal{M}^p$, defined as abstract completions of sets of smooth functions with respect to a weighted…

We study 3-coloring properties of triangle-free planar graphs $G$ with two precolored 4-cycles $C_1$ and $C_2$ that are far apart. We prove that either every precoloring of $C_1\cup C_2$ extends to a 3-coloring of $G$, or $G$ contains one…

In $p$-adic Hodge theory and the $p$-adic Langlands program, Banach spaces with $\mathbb{Q}_p$-coefficients and $p$-adic Lie group actions are central. Studying the subrepresentation of $\Gamma$-locally analytic vectors, $W^{\mathrm{la}}$,…

We initiate the study of Iwasawa theory for branched $\mathbb{Z}_{p}$-towers of finite connected graphs. These towers are more general than what have been studied so far, since the morphisms of graphs involved are branched covers, a…

This paper is dedicated to new methods of constructing weight structures and weight-exact localizations; our arguments generalize their bounded versions considered in previous papers of the authors. We start from a class of objects $P$ of…

It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…

We study structural aspects of randomized parameterized computation. We introduce a new class ${\sf W[P]}$-${\sf PFPT}$ as a natural parameterized analogue of ${\sf PP}$. Our definition uses the machine based characterization of the…

This note pursues the techniques of modified psi classes on the stack of stable maps (cf. [Graber-Kock-Pandharipande]) to give concise solutions to the characteristic number problem of rational curves in P^2 or P^1 x P^1 with a cusp or a…