10 citations · 52 across the 22 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2022
Weak randomness in graphons and theons
Leonardo N. Coregliano, Maryanthe Malliaris
Call a hereditary family of graphs strongly persistent if there exists a graphon such that in all subgraphons of , is precisely the class of…
math.CO2022
Countable Ramsey
Leonardo N. Coregliano, Maryanthe Malliaris
The celebrated Erdős-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size , which is a much be…