Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, December 03, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Choongbum Lee (MIT)

Two approaches to Sidorenko's conjecture

Sidorenko's conjecture states that the number of homomorphisms from a bipartite graph H to a graph G is at least the expected number of homomorphisms from H to the binomial random graph with the same expected edge density as G. In this talk, I will present two approaches to the conjecture. First, I will introduce the notion of tree-arrangeability, where a bipartite graph H with bipartition A \cup B is tree-arrangeable if neighborhoods of vertices in A have a certain tree-like structure, and show that Sidorenko's conjecture holds for all tree-arrangeable bipartite graphs. In particular, this implies that Sidorenko's conjecture holds if there are two vertices a1, a2 in A such that each vertex a in A satisfies N(a) \subseteq N(a1) or N(a) \subseteq N(a_2). Second, I will prove that if T is a tree and H is a bipartite graph satisfying Sidorenko's conjecture, then the Cartesian product of T and H also satisfies Sidorenko's conjecture. This result implies that, for all d \ge 2, the d-dimensional grid with arbitrary side lengths satisfies Sidorenko's conjecture.

Joint with Jeong Han Kim (KIAS) and Joonkyung Lee (Oxford)

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login