Minimal reducible bounds for induced-hereditary properties

AbstractLet (Ma,⊆) and (La,⊆) be the lattices of additive induced-hereditary properties of graphs and additive hereditary properties of graphs, respectively. A property R∈Ma (∈La) is called a minimal reducible bound for a property P∈Ma (∈La) if in the interval (P,R) of the lattice Ma (La) there are only irreducible properties. The set of all minimal reducible bounds of a property P∈Ma in the lattice Ma we denote by BM(P). Analogously, the set of all minimal reducible bounds of a property P∈La in La is denoted by BL(P).We establish a method to determine minimal reducible bounds for additive degenerate induced-hereditary (hereditary) properties of graphs. We show that this method can be successfully used to determine already known minimal reducible bounds for k-degenerate graphs and outerplanar graphs in the lattice La. Moreover, in terms of this method we describe the sets of minimal reducible bounds for partial k-trees and the graphs with restricted order of components in La and k-degenerate graphs in Ma

Minimal reducible bounds for the class of k-degenerate graphs

AbstractLet (La,⊆) be the lattice of hereditary and additive properties of graphs. A reducible property R∈La is called minimal reducible bound for a property P∈La if in the interval (P,R) of the lattice La, there are only irreducible properties. We prove that the set B(Dk)={Dp∘Dq:k=p+q+1} is the covering set of minimal reducible bounds for the class Dk of all k-degenerate graphs

J-holomorphic curves in a nef class

Taubes established fundamental properties of $J-$holomorphic subvarieties in dimension 4 in \cite{T1}. In this paper, we further investigate properties of reducible $J-$holomorphic subvarieties. We offer an upper bound of the total genus of a subvariety when the class of the subvariety is $J-$nef. For a spherical class, it has particularly strong consequences. It is shown that, for any tamed $J$, each irreducible component is a smooth rational curve. We also completely classify configurations of maximal dimension. To prove these results we treat subvarieties as weighted graphs and introduce several combinatorial moves.Comment: 30 pages. v2 Section 4.3 revised; minor changes elsewhere. v3 mistakes correcte