Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms

DOI10.1016/j.ejc.2010.05.007zbMath1204.06009OpenAlexW2082113404MaRDI QIDQ710720

Jaroslav Nešetřil, Erkko Lehtonen

Publication date: 22 October 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2010.05.007

zbMATH Keywords

hypergraphsrepresentation of Boolean functionsclone of clique functionsclone of self-dual monotone functions

Mathematics Subject Classification ID

Hypergraphs (05C65) Boolean functions (06E30) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items (2)

Galois theory for analogical classifiers ⋮ Universality of intervals of line graph order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The threshold order of a Boolean function
• Descending chains and antichains of the unary, linear, and monotone subfunction relations
• Equivalence of operations with respect to discriminator clones
• Color-families are dense
• Post's closed systems and the weak chromatic number of hypergraphs
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• The forbidden projections of unate functions
• Galois theory for minors of finite functions
• Universal partial order represented by means of oriented trees and other simple graphs
• Post classes characterized by functional terms
• Boolean minors
• Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
• Labeled posets are universal
• A note on minors determined by clones of semilattices
• Density of universal classes of series-parallel graphs
• The Homomorphism Structure of Classes of Graphs
• On the Classification of Boolean Functions by the General Linear and Affine Groups
• Function Algebras on Finite Sets
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• Finite paths are universal

This page was built for publication: Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms