1 citations · 1 across the 5 of their papers we have counts for
4 papers · 1 filter
Adjunctions, Box Products, and Forcing Families
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. For bipartite…
An Unsure Note on an Un-Schur Problem
Olaf Parczyk, Christoph Spiegel
Graham, Rödl, and Ruciński originally posed the problem of determining the minimum number of monochromatic Schur triples that must appear in any 2-coloring of the first integer…
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…
Spanning spheres in Dirac hypergraphs
Freddie Illingworth, Richard Lang, Alp Müyesser +2
We show that a -uniform hypergraph on vertices has a spanning subgraph homeomorphic to the -dimensional sphere provided that has no isolated vertices and each s…