Pages that link to "Item:Q3828021"
From MaRDI portal
The following pages link to A counterexample to the rank-coloring conjecture (Q3828021):
Displaying 17 items.
- A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825) (← links)
- The minimum semidefinite rank of a triangle-free graph (Q630548) (← links)
- Some relations among term rank, clique number and list chromatic number of a graph (Q856854) (← links)
- The chromatic number and rank of the complements of the Kasami graphs (Q861803) (← links)
- The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear (Q1201273) (← links)
- Communication complexity and combinatorial lattice theory (Q1309387) (← 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)
- Rank, term rank and chromatic number of a graph (Q1764180) (← 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)
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822) (← links)
- On set intersection representations of graphs (Q3633007) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
