The quantifier semigroup for bipartite graphs

MaRDI QIDQ547781zbMATH OpenFDO

Authors Leonard J. Schulman

Publication date 24 June 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/233384, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p123.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Ordered semigroups and monoids (06F05)

Review text

Summary: 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.

Recommendations

• scientific article; zbMATH DE number 4010572
• Bipartite graphs and completely 0-simple semigroups.
• Quasimonotone graphs
• On a product dimension of bipartite graphs
• scientific article; zbMATH DE number 4160792

Cited in

(2)

• scientific article; zbMATH DE number 3871333 (Why is no real title available?)
• Bipartite graphs as polynomials and polynomials as bipartite graphs

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: The quantifier semigroup for bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547781)