1 citations · 1 across the 1 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2018
The step Sidorenko property and non-norming edge-transitive graphs
Daniel Král', Taísa Martins, Péter Pál Pach +1
Sidorenko's Conjecture asserts that every bipartite graph H has the Sidorenko property, i.e., a quasirandom graph minimizes the density of H among all graphs with the same edge den…
math.CO2012★ 1 cited
A new operation on partially ordered sets
Péter Pál Pach, Michael Pinsker, András Pongrácz +1
Recently it has been shown that all non-trivial closed permutation groups containing the automorphism group of the random poset are generated by two types of permutations: the firs…