The following pages link to Many cliques with few edges (Q2223482):
Displaying 9 items.
- Very large cliques are easy to detect (Q932700) (← links)
- Many cliques with few edges and bounded maximum degree (Q1984508) (← links)
- A simple proof of the Gan-Loh-Sudakov conjecture (Q2088706) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- Large cliques and independent sets all over the place (Q4992901) (← links)
- How many cliques can a clique cover cover? (Q6115508) (← links)
- Many Cliques in Bounded-Degree Hypergraphs (Q6170441) (← links)
- On the maximum number of maximum dissociation sets in trees with given dissociation number (Q6204327) (← links)
- Exact results on generalized Erdős-Gallai problems (Q6568830) (← links)