Improved boolean formulas for the Ramsey graphs

DOI10.1002/rsa.3240060404zbMath0824.60009OpenAlexW2135251664MaRDI QIDQ4845078

Petr Savický

Publication date: 31 October 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240060404

zbMATH Keywords

random graphsBoolean formulasalmost uniform distributionrepresented graphs

Mathematics Subject Classification ID

Related Items (3)

Randomized OBDD-based graph algorithms ⋮ Randomized OBDD-Based Graph Algorithms ⋮ Almost \(k\)-wise independence and hard Boolean functions.

Cites Work

• Decomposition of graphs and monotone formula size of homogeneous functions
• Intersection theorems with geometric consequences
• Simple Constructions of Almost k-wise Independent Random Variables
• A Constructive Solution to a Tournament Problem

This page was built for publication: Improved boolean formulas for the Ramsey graphs