An L-close Sperner family on an n-element set has at most sum_{h=0}^{|L|} C(n,h) members, and at most n members when L contains exactly one positive integer.
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
A hypergraph is said to be $1$-Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of $1$-Sperner hypergraphs and their structure to graphs. In particular, we consider the classical characterizations of threshold and domishold graphs and use them to obtain further characterizations of these classes in terms of $1$-Spernerness, thresholdness, and $2$-asummability of their vertex cover, clique, dominating set, and closed neighborhood hypergraphs. Furthermore, we apply a decomposition property of $1$-Sperner hypergraphs to derive decomposition theorems for two classes of split graphs, a class of bipartite graphs, and a class of cobipartite graphs. These decomposition theorems are based on certain matrix partitions of the corresponding graphs, giving rise to new classes of graphs of bounded clique-width and new polynomially solvable cases of several domination problems.
fields
math.CO 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
On $L$-close Sperner systems
An L-close Sperner family on an n-element set has at most sum_{h=0}^{|L|} C(n,h) members, and at most n members when L contains exactly one positive integer.