Pages that link to "Item:Q4083459"

The following pages link to A Bound for the Chromatic Number of a Graph (Q4083459):

Displaying 11 items.

• Some relations among term rank, clique number and list chromatic number of a graph (Q856854) (← links)
• Communication complexity and combinatorial lattice theory (Q1309387) (← links)
• On order and rank of graphs (Q1701307) (← links)
• Rank, term rank and chromatic number of a graph (Q1764180) (← links)
• On rank vs. communication complexity (Q1906852) (← 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)
• An Additive Combinatorics Approach Relating Rank to Communication Complexity (Q5501927) (← links)
• Around the log-rank conjecture (Q6050267) (← links)
• On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph (Q6098089) (← links)