The following pages link to (Q5678865):
Displaying 19 items.
- An exact result for \((0, \pm 1)\)-vectors (Q723491) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- Multicolored lines in a finite geometry (Q1112829) (← links)
- Generalized k-tuple colorings of cycles and other graphs (Q1154475) (← links)
- An intersection problem whose extremum is the finite projective space (Q1158431) (← links)
- Intersection graphs of k-uniform linear hypergraphs (Q1167187) (← links)
- Matrices dont deux lignes quelconque coincident dans un nombre donne de positions communes (Q1225057) (← links)
- On finite Delta-systems. II (Q1236531) (← links)
- Partitioning permutations into increasing and decreasing subsequences (Q1906146) (← links)
- A distributed algorithm for spectral sparsification of graphs with applications to data clustering (Q2056927) (← links)
- A note on weak delta systems (Q2324492) (← links)
- The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
- Erdös–Ko–Rado Theorem—22 Years Later (Q3041202) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Sunflowers and -intersecting families (Q5154604) (← links)
- The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) (← links)
- Independence numbers of Johnson-type graphs (Q6115445) (← links)
- On restricted intersections and the sunflower problem (Q6121916) (← links)
- The intersection spectrum of 3-chromatic intersecting hypergraphs (Q6604685) (← links)
