Related Experiment Video
Updated: May 5, 2026

Author Spotlight: Experimental Approaches for the Synthesis of Low-Valent Metal-Organic Frameworks from Multitopic Phosphine Linkers
Published on: May 12, 2023
A Graph-Theoretic Approach to Minimizing Union Operations for Optimal FMO Construction
Ryan Kmet1, Shuchan Zhou1, David Novo1
1De Novo Research, Pasadena, California, USA.
Abstract:
We model the process of computing all -element subsets of an -element set (representing a set of fluorescence minus one [FMO] controls) using only binary union operations. By representing this process as a Directed Acyclic Graph (DAG), we present an algorithm that can make all FMOs in the theoretical minimum unions (when ). Finally, we generalize the construction to arbitrary subsets of leave-one-out targets and prove a bound on the number of operations in such cases.
Related Concept Videos
Graphical Representation of Inequalities
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Hückel's Rule Diagram of π MOs: Frost Circle
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so...
Optimization Problems
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Graphs of Functions
