Fillings of skew shapes avoiding diagonal patterns

A skew shape is the difference of two top-left justified Ferrers shapes sharing the same top-left corner. We study integer fillings of skew shapes. As our first main result, we show that for a specific hereditary class of skew shapes, which we call D-free shapes, the fillings that avoid a north-east chain of size $k$ are in bijection with fillings that avoid a south-east chain of the same size. Since Ferrers shapes are a subclass of D-free shapes, this result can be seen as a generalization of previous analogous results for Ferrers shapes. As our second main result, we construct a bijection between 01-fillings of an arbitrary skew shape that avoid a south-east chain of size 2, and the 01-fillings of the same shape that simultaneously avoid a north-east chain of size 2 and a particular non-square subfilling. This generalizes a previous result for transversal fillings. Comment: 23 pages, 14 figures; formatting changes for publication in DMTCS, no changes in content

Reconfiguring Dominating Sets in Minor-Closed Graph Classes

For a graph G, two dominating sets D and $$D'$$ D ′ in G, and a non-negative integer k, the set D is said to k-transform to $$D'$$ D ′ if there is a sequence $$D_0,\ldots ,D_\ell $$ D 0 , … , D ℓ of dominating sets in G such that $$D=D_0$$ D = D 0 , $$D'=D_\ell $$ D ′ = D ℓ , $$|D_i|\le k$$ | D i | ≤ k for every $$i\in \{ 0,1,\ldots ,\ell \}$$ i ∈ { 0 , 1 , … , ℓ } , and $$D_i$$ D i arises from $$D_{i-1}$$ D i - 1 by adding or removing one vertex for every $$i\in \{ 1,\ldots ,\ell \}$$ i ∈ { 1 , … , ℓ } . We prove that there is some positive constant c and there are toroidal graphs G of arbitrarily large order n, and two minimum dominating sets D and $$D'$$ D ′ in G such that Dk-transforms to $$D'$$ D ′ only if $$k\ge \max \{ |D|,|D'|\}+c\sqrt{n}$$ k ≥ max { | D | , | D ′ | } + c n . Conversely, for every hereditary class $$\mathcal{G}$$ G that has balanced separators of order $$n\mapsto n^\alpha $$ n ↦ n α for some $$\alpha <1$$ α < 1 , we prove that there is some positive constant C such that, if G is a graph in $$\mathcal{G}$$ G of order n, and D and $$D'$$ D ′ are two dominating sets in G, then Dk-transforms to $$D'$$ D ′ for $$k=\max \{ |D|,|D'|\}+\lfloor Cn^\alpha \rfloor $$ k = max { | D | , | D ′ | } + ⌊ C n α ⌋ .

Weakly m-compact via a hereditary class

The aim of this paper is to introduce and study some types of m-compactness with respect to a hereditary class called weakly mH-compact spaces and weakly mH-compact subsets. We will provide several characterizations of weakly mH-compact spaces and investigate their relationships with some other classes of generalized topological spaces.

On $$\psi _{{\mathcal{H}}}( . )$$-operator in weak structure spaces with hereditary classes

Weak structure space (briefly, wss) has master looks, when the whole space is not open, and these classes of subsets are not closed under arbitrary unions and finite intersections, which classify it from typical topology. Our main target of this article is to introduce $$\psi _{{\mathcal {H}}}(.)$$ ψ H ( . ) -operator in hereditary class weak structure space (briefly, $${\mathcal {H}}wss$$ H w s s ) $$(X, w, {\mathcal {H}})$$ ( X , w , H ) and examine a number of its characteristics. Additionally, we clarify some relations that are credible in topological spaces but cannot be realized in generalized ones. As a generalization of w-open sets and w-semiopen sets, certain new kind of sets in a weak structure space via $$\psi _{{\mathcal {H}}}(.)$$ ψ H ( . ) -operator called $$\psi _{{\mathcal {H}}}$$ ψ H -semiopen sets are introduced. We prove that the family of $$\psi _{{\mathcal {H}}}$$ ψ H -semiopen sets composes a supra-topology on X. In view of hereditary class $${\mathcal {H}}_{0}$$ H 0 , $$w T_{1}$$ w T 1 -axiom is formulated and also some of their features are investigated.

The Heredity of Senatorial Status in the Principate

Since Mommsen, it has been a tenet of Roman history that Augustus transformed the ‘senatorial order’ into a hereditary class, which encompassed senators, their children, grandchildren and great-grandchildren in the male line. This paper shows that the idea of a hereditary ordo senatorius is a myth without foundation in the evidence. Augustus and his successors conferred new rights and duties upon relatives of senators, but did not change their formal rank. Moreover, the new regulations applied not to three generations of descendants, but only to persons who stood under a senator's patria potestas during his lifetime. Emperors protected the honour and property of these filii familias of senators, in order to incentivise them to participate in politics and invest their wealth into munificence. The Supplementary Material available online gives all known early imperial holders of the title clarissimus vir in the province of Africa (Supplementary Appendix 1), all known early imperial clarissimi iuuenes (Supplementary Appendix 2) and all known early imperial clarissimi pueri (Supplementary Appendix 3).

Graphs of bounded cliquewidth are polynomially $χ$-bounded

We prove that if $\mathcal{C}$ is a hereditary class of graphs that is polynomially $\chi$-bounded, then the class of graphs that admit decompositions into pieces belonging to $\mathcal{C}$ along cuts of bounded rank is also polynomially $\chi$-bounded. In particular, this implies that for every positive integer $k$, the class of graphs of cliquewidth at most $k$ is polynomially $\chi$-bounded.

A complete classification of the complexity of the vertex 3-colourability problem for quadruples of induced 5-vertex prohibitions

The vertex 3-colourability problem for a given graph is to check whether it is possible to split the set of its vertices into three subsets of pairwise non-adjacent vertices or not. A hereditary class of graphs is a set of simple graphs closed under isomorphism and deletion of vertices; the set of its forbidden induced subgraphs defines every such a class. For all but three the quadruples of 5-vertex forbidden induced subgraphs, we know the complexity status of the vertex 3-colourability problem. Additionally, two of these three cases are polynomially equivalent; they also polynomially reduce to the third one. In this paper, we prove that the computational complexity of the considered problem in all of the three mentioned classes is polynomial. This result contributes to the algorithmic graph theory.