Published August 20, 2019
| Submitted
Report
Open
Sidorenko's conjecture for a class of graphs: an exposition
- Creators
- Conlon, David
- Fox, Jacob
- Sudakov, Benny
Abstract
A famous conjecture of Sidorenko and Erdős-Simonovits states that if H is a bipartite graph then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same order and edge density. The goal of this expository note is to give a short self-contained proof (suitable for teaching in class) of the conjecture if H has a vertex complete to all vertices in the other part.
Attached Files
Submitted - 1209.0184.pdf
Files
1209.0184.pdf
Files
(79.2 kB)
Name | Size | Download all |
---|---|---|
md5:0953ebc2c8797b81daea42a1db6a5119
|
79.2 kB | Preview Download |
Additional details
- Eprint ID
- 98018
- Resolver ID
- CaltechAUTHORS:20190819-170842963
- Created
-
2019-08-20Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field