Showing 2024Show all
2 papers · 1 filter
math.CO2024
Forcing Graphs to be Forcing
Aldo Kiem, Olaf Parczyk, Christoph Spiegel
Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing co…
math.CO2024
Dirac's theorem for graphs of bounded bandwidth
Alberto Espuny DÃaz, Pranshu Gupta, Domenico Mergoni Cecchelli +2
We provide an optimal sufficient condition, relating minimum degree and bandwidth, for a graph to contain a spanning subdivision of the complete bipartite graph . This…