maximum clique
- 2022/09 Tran2022
- page 19 : bounded twin-cover number does not imply bounded maximum clique – Observation 3.4. Twin Cover Number is incomparable to Maximum Clique, Domatic Number and Distance to Disconnected.
- page 19 : bounded maximum clique does not imply bounded twin-cover number – Observation 3.4. Twin Cover Number is incomparable to Maximum Clique, Domatic Number and Distance to Disconnected.
- page 34 : bounded c-closure does not imply bounded maximum clique – Observation 5.7. $c$-Closure is incomparable to Distance to Disconnected, Domatic Number and Maximum Clique.
- page 34 : bounded maximum clique does not imply bounded c-closure – Observation 5.7. $c$-Closure is incomparable to Distance to Disconnected, Domatic Number and Maximum Clique.
- https://mathworld.wolfram.com/MaximumClique.html
- maximum clique – A maximum clique of a graph $G$ is a clique (i.e., complete subgraph) of maximum possible size for $G$.
- unknown
- chromatic number $k$ upper bounds maximum clique by $\mathcal O(k)$ – Unbounded clique implies the number of needed colors is unbounded.
- graph class complete has unbounded maximum clique – Parameter is unbounded for the graph class of cliques.
- SchroderThesis
- page 16 : bounded distance to complete does not imply bounded maximum clique – Proposition 3.7
- page 33 : bounded bisection bandwidth does not imply bounded maximum clique – Proposition 3.33
- page 35 : bounded average degree does not imply bounded maximum clique – Proposition 3.35