Pages that link to "Item:Q1705815"
From MaRDI portal
The following pages link to The complexity of proving that a graph is Ramsey (Q1705815):
Displaying 6 items.
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- Large clique is hard on average for resolution (Q2117104) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- (Q5326602) (redirect page) (← links)
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture (Q6049024) (← links)
