The following pages link to A reverse Sidorenko inequality (Q785934):
Displaying 18 items.
- The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph (Q518178) (← links)
- A proof of the upper matching conjecture for large graphs (Q1984527) (← links)
- Unified approach to the generalized Turán problem and supersaturation (Q2065917) (← links)
- On one asymptotic equality proved by Revers (Q2098846) (← links)
- A path forward: tropicalization in extremal combinatorics (Q2166338) (← links)
- Counting independent sets in regular hypergraphs (Q2229168) (← links)
- The number of independent sets in an irregular graph (Q2312617) (← links)
- Bounding the partition function of spin-systems (Q2500991) (← links)
- Impartial digraphs (Q2663414) (← links)
- (Q4016595) (← links)
- On a quantitative reversal of Alexandrov’s inequality (Q4645118) (← links)
- (Q4670190) (← links)
- (Q4789338) (← links)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
- Interview with Yufei Zhao (Q5056214) (← links)
- Diagonal Ramsey via effective quasirandomness (Q6046448) (← links)
- Algorithms for the ferromagnetic Potts model on expanders (Q6632817) (← links)
- Maximizing the number of \(H\)-colorings of graphs with a fixed minimum degree (Q6640963) (← links)
