The following pages link to Ewan Davies (Q322279):
Displaying 22 items.
- Counting in hypergraphs via regularity inheritance (Q322280) (← links)
- On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs (Q824265) (← links)
- A proof of the upper matching conjecture for large graphs (Q1984527) (← links)
- Counting proper colourings in 4-regular graphs via the Potts model (Q1991414) (← links)
- Multicolour Ramsey numbers of paths and even cycles (Q2357225) (← links)
- On the average size of independent sets in triangle-free graphs (Q4590969) (← links)
- Extremes of the internal energy of the Potts model on cubic graphs (Q4684327) (← links)
- The $\chi$-Ramsey Problem for Triangle-Free Graphs (Q5074951) (← links)
- (Q5092461) (← links)
- Coloring triangle‐free graphs with local list sizes (Q5136931) (← links)
- Independent sets, matchings, and occupancy fractions (Q5357226) (← links)
- Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs (Q5890038) (← links)
- Tight bounds on the coefficients of partition functions via stability (Q5915725) (← links)
- Tight bounds on the coefficients of partition functions via stability (Q5970255) (← links)
- Occupancy fraction, fractional colouring, and triangle fraction (Q6080864) (← links)
- Packing list‐colorings (Q6185050) (← links)
- Statistical physics approaches to Unique Games (Q6328511) (← links)
- Efficient algorithms for the Potts model on small-set expanders (Q6503931) (← links)
- Sampling List Packings (Q6520484) (← links)
- Efficient algorithms for the Potts model on small-set expanders (Q6538425) (← links)
- Algorithms for the ferromagnetic Potts model on expanders (Q6632817) (← links)
- A robust Corrádi-Hajnal theorem (Q6641058) (← links)
