The following pages link to (Q172210):
Displaying 50 items.
- Color the cycles (Q383778) (← links)
- Sperner type theorems with excluded subposets (Q385154) (← links)
- Minimum average-case queries of \(q+1\)-ary search game with small sets (Q412374) (← links)
- Two-colorings with many monochromatic cliques in both colors (Q463286) (← links)
- Union-intersecting set systems (Q497346) (← links)
- Around the complete intersection theorem (Q516788) (← links)
- Finding at least one excellent element in two rounds (Q538153) (← links)
- Recent combinatorial results in the theory of relational databases (Q596957) (← links)
- (Q787143) (redirect page) (← links)
- Minimal 2-coverings of a finite affine space based on GF(2) (Q787145) (← links)
- Intersecting Sperner families and their convex hulls (Q796532) (← links)
- Incomparable copies of a poset in the Boolean lattice. (Q890018) (← links)
- Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\) (Q953271) (← links)
- (Q1065560) (redirect page) (← links)
- Minimum matrix representation of closure operations (Q1065561) (← links)
- Extremal hypergraph problems and convex hulls (Q1066910) (← links)
- Polytopes determined by hypergraph classes (Q1073043) (← links)
- All maximum 2-part Sperner families (Q1088662) (← links)
- The poset of closures as a model of changing databases (Q1104951) (← links)
- Convex hulls of more-part Sperner families (Q1115870) (← links)
- On the number of maximal dependencies in a data base relation of fixed order (Q1148702) (← links)
- Sums of vectors and Turan's problem for 3-graphs (Q1153160) (← links)
- Partial dependencies in relational databases and their realization (Q1202886) (← links)
- The characterization of branching dependencies (Q1202887) (← links)
- Contributions to the geometry of Hamming spaces (Q1242920) (← links)
- Greedy construction of nearly regular graphs (Q1260772) (← links)
- A simple proof of a theorem of Milner (Q1268609) (← links)
- Design type problems motivated by database theory (Q1299042) (← links)
- The largest component in a random subgraph of the \(n\)-cycle (Q1309458) (← links)
- A survey of some combinatorial results concerning functional dependencies in database relations. (Q1353952) (← links)
- Extremal problems for finite sets and convex hulls---a survey (Q1356702) (← links)
- A brief biographical sketch of Paul Erdős (Q1361652) (← links)
- Asymptotic properties of keys and functional dependencies in random databases (Q1389444) (← links)
- Strong qualitative independence. (Q1422407) (← links)
- Results on the Wiener profile (Q1643913) (← links)
- Solution of a problem of A. Ehrenfeucht and J. Mycielski (Q1846871) (← links)
- On the average size of sets in intersecting Sperner families (Q1850012) (← links)
- New type of coding problem motivated by database theory (Q1885817) (← links)
- On the distance of databases (Q1928825) (← links)
- Majority and plurality problems (Q1946224) (← links)
- The domination number of the graph defined by two levels of the \(n\)-cube (Q2026316) (← links)
- On strengthenings of the intersecting shadow theorem (Q2049446) (← links)
- The Turán number of the square of a path (Q2057579) (← links)
- Largest family without a pair of posets on consecutive levels of the Boolean lattice (Q2140991) (← links)
- A generalization of the independence number (Q2172382) (← links)
- Adaptive majority problems for restricted query graphs and for weighted sets (Q2208365) (← links)
- The domination number of the graph defined by two levels of the \(n\)-cube. II (Q2225404) (← links)
- Existence of a maximum balanced matching in the hypercube (Q2320869) (← links)
- Codes that attain minimum distance in every possible direction (Q2425557) (← links)
- No four subsets forming an \(N\) (Q2427561) (← links)
