On a class of Boolean functions with matroid property

DOI10.1016/0012-365X(84)90173-0zbMATH Open0539.05022OpenAlexW1979705538MaRDI QIDQ793741FDOQ793741

Authors: Françoise Garoche, Michel Leonard 

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90173-0

Recommendations

• Functions computed by monotone Boolean formulas with no repeated variables
• scientific article; zbMATH DE number 5852793
• Boolean techniques for matroidal decomposition of independence systems and applications to graphs
• On connected Boolean functions
• Coverings of Boolean graphs

zbMATH Keywords

bipartite digraphdisjunctive normal form

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of matroids and geometric lattices (05B35) Logical aspects of Boolean algebras (03G05)

Cited In (4)

• Boolean degree 1 functions on some classical association schemes
• Excluded minors for Boolean polymatroids
• On connected Boolean functions
• Title not available (Why is that?)

This page was built for publication: On a class of Boolean functions with matroid property

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