The following pages link to (Q5688995):
Displayed 11 items.
- Maximal equilateral sets (Q368756) (← links)
- Clique versus independent set (Q402465) (← links)
- Biclique covers and partitions (Q405095) (← links)
- A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825) (← links)
- On the biclique cover of the complete graph (Q897237) (← links)
- On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
- Decompositions of complete multigraphs derived from Hadamard matrices (Q1399905) (← links)
- Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
- Ordered biclique partitions and communication complexity problems (Q2342387) (← links)
- Bipartite decomposition of random graphs (Q2347851) (← links)
- Some improved bounds on communication complexity via new decomposition of cliques (Q2636816) (← links)