The following pages link to (Q5688995):
Displaying 20 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)
- Biclique cover and local clique cover of graphs (Q1734028) (← links)
- Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
- Multicovering hypergraphs (Q2022167) (← links)
- Regarding two conjectures on clique and biclique partitions (Q2121747) (← links)
- Nearly neighbourly families of standard boxes (Q2278122) (← links)
- The biclique covering number of grids (Q2335697) (← 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)
- Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs (Q5163156) (← links)
- New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\) (Q6056562) (← links)
- Finding biclique partitions of co-chordal graphs (Q6162046) (← links)
- Exact values and improved bounds on \(k\)-neighborly families of boxes (Q6201906) (← links)
