Pages that link to "Item:Q452825"
From MaRDI portal
The following pages link to A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825):
Displaying 17 items.
- Clique versus independent set (Q402465) (← links)
- Decomposition techniques applied to the clique-stable set separation problem (Q1709553) (← links)
- Multicovering hypergraphs (Q2022167) (← links)
- Regarding two conjectures on clique and biclique partitions (Q2121747) (← links)
- Eigenvalues of Cayley graphs (Q2138565) (← links)
- Coloring temporal graphs (Q2237899) (← 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)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- (Q4691855) (← links)
- Communication Complexity of Pairs of Graph Families with Applications (Q5111227) (← links)
- New bounds on the maximum number of neighborly boxes in \(\mathbb{R}^d\) (Q6056562) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- Problems close to my heart (Q6116410) (← links)
- Exact values and improved bounds on \(k\)-neighborly families of boxes (Q6201906) (← links)
