Paper Info
Title
The Quantifier Semigroup for Bipartite Graphs.
Abstract
In a bipartite graph there are two widely encountered monotone mappings from subsets of one side of the graph to subsets of the other side: one corresponds to the quantifier "there exists a neighbor in the subset" and the other to the quantifier "all neighbors are in the subset." These mappings generate a partially ordered semigroup which we characterize in terms of "run-unimodal" words.
Year
Venue
Field
2011
ELECTRONIC JOURNAL OF COMBINATORICS
Ordered semigroup,Quantifier elimination,Discrete mathematics,Graph,Combinatorics,Existential quantification,Bipartite graph,Semigroup,Mathematics,Monotone polygon
DocType
Volume
Issue
Journal
18
1.0
ISSN
Citations 
PageRank 
1077-8926
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Leonard J. Schulman11328136.88