Pages that link to "Item:Q1199993"
From MaRDI portal
The following pages link to Qualitative independence and Sperner problems for directed graphs (Q1199993):
Displaying 15 items.
- Multiplicity-free permutation representations of the symmetric group. (Q659813) (← links)
- The Sperner capacity of linear and nonlinear codes for the cyclic triangle (Q686982) (← links)
- Different capacities of a digraph (Q1334937) (← links)
- Capacities: From information theory to extremal set theory (Q1337171) (← links)
- Capacities of graphs and \(2\)-matchings (Q1584259) (← links)
- On the capacity of Boolean graph formulæ (Q1805371) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- Rényi 100, quantitative and qualitative (in)dependence (Q2236653) (← links)
- On quorum systems for group resources allocation (Q2377138) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- Local chromatic number and Sperner capacity (Q2565689) (← links)
- On colorful edge triples in edge-colored complete graphs (Q2657036) (← links)
- (Q2857343) (← links)
- Generalized covering designs and clique coverings (Q3100732) (← links)
- (Q4242741) (← links)
