8 citations · 11 across the 19 of their papers we have counts for
4 papers · 1 filter
Exact Completeness of LP Hierarchies for Linear Codes
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones
Determining the maximum size of a binary code of blocklength and distance remains an elusive open question even when restricted to the important class of linear…
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…
Left-cut-percolation and induced-Sidorenko bigraphs
Leonardo N. Coregliano
A Sidorenko bigraph is one whose density in a bigraphon is minimized precisely when is constant. Several techniques of the literature to prove the Sidorenko property consis…
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…