Pages that link to "Item:Q1201273"
From MaRDI portal
The following pages link to The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear (Q1201273):
Displaying 17 items.
- Clique versus independent set (Q402465) (← links)
- A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825) (← links)
- The chromatic number and rank of the complements of the Kasami graphs (Q861803) (← links)
- The log-rank conjecture and low degree polynomials (Q1029056) (← links)
- Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
- Some combinatorial-algebraic problems from complexity theory (Q1344621) (← links)
- The corruption bound, log-rank, and communication complexity (Q1621501) (← links)
- On order and rank of graphs (Q1701307) (← links)
- Chromatic number and the 2-rank of a graph (Q1850515) (← links)
- On rank vs. communication complexity (Q1906852) (← links)
- On the ``log rank''-conjecture in communication complexity (Q1906853) (← links)
- Matrix rank and communication complexity (Q1970502) (← links)
- Eigenvalues of Cayley graphs (Q2138565) (← links)
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822) (← links)
- On the binary and Boolean rank of regular matrices (Q2689370) (← links)
- On set intersection representations of graphs (Q3633007) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
