The following pages link to Clique versus independent set (Q402465):
Displaying 8 items.
- Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
- Excluding hooks and their complements (Q1671647) (← links)
- Decomposition techniques applied to the clique-stable set separation problem (Q1709553) (← links)
- Ordered biclique partitions and communication complexity problems (Q2342387) (← links)
- Some improved bounds on communication complexity via new decomposition of cliques (Q2636816) (← links)
- On the binary and Boolean rank of regular matrices (Q2689370) (← links)
- Communication Complexity of Pairs of Graph Families with Applications (Q5111227) (← links)
- Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
