20 citations · 77 across the 24 of their papers we have counts for
27 papers
Distinct degrees and homogeneous sets II
Eoin Long, Laurentiu Ploscaru
Given an -vertex graph , let denote the size of a largest homogeneous set in and let denote the maximal number of distinct degrees appearing in an induc…
A bipartite version of the Erdős McKay conjecture
Eoin Long, Laurentiu Ploscaru
An old conjecture of Erdős and McKay states that if all homogeneous sets in an -vertex graph are of order then the graph contains induced subgraphs of each size from…
Distinct degrees and homogeneous sets
Eoin Long, Laurentiu Ploscaru
In this paper we investigate the extremal relationship between two well-studied graph parameters: the order of the largest homogeneous set in a graph and the maximal number of…
Global hypercontractivity and its applications
Peter Keevash, Noam Lifshitz, Eoin Long +1
The hypercontractive inequality on the discrete cube plays a crucial role in many fundamental results in the Analysis of Boolean functions, such as the KKL theorem, Friedgut's junt…
Forbidden intersections for codes
Peter Keevash, Noam Lifshitz, Eoin Long +1
Determining the maximum size of a -intersecting code in was a longstanding open problem of Frankl and Füredi, solved independently by Ahlswede and Khachatrian and by Fra…
Tournament quasirandomness from local counting
M. Bucić, E. Long, A. Shapira +1
A well-known theorem of Chung and Graham states that if then a tournament is quasirandom if and only if contains each -vertex tournament the "correct number" o…