default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEoin Long
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Eoin Long
, Laurentiu Ploscaru:
A bipartite version of the Erdős-McKay conjecture. Comb. Probab. Comput. 32(3): 465-477 (2023)- [j17]Eoin Long, Laurentiu Ploscaru:
Distinct degrees and homogeneous sets. J. Comb. Theory B 159: 61-100 (2023) - 2021
- [j16]Matija Bucic, Eoin Long, Asaf Shapira, Benny Sudakov:
Tournament Quasirandomness from Local Counting. Comb. 41(2): 175-208 (2021) - 2020
- [j15]J. Robert Johnson, Imre Leader, Eoin Long:
Correlation for permutations. J. Comb. Theory A 175: 105260 (2020) - [j14]Peter Keevash, Eoin Long:
Stability for vertex isoperimetry in the cube. J. Comb. Theory B 145: 113-144 (2020)
2010 – 2019
- 2019
- [j13]Asaf Ferber, Eoin Long:
Packing and counting arbitrary Hamilton cycles in random digraphs. Random Struct. Algorithms 54(3): 499-514 (2019) - 2018
- [j12]Peter Keevash, Eoin Long:
A stability result for the cube edge isoperimetric inequality. J. Comb. Theory A 155: 360-375 (2018) - 2017
- [j11]Eoin Long:
Large Unavoidable Subtournaments. Comb. Probab. Comput. 26(1): 68-77 (2017) - [j10]Ilan Karpas, Eoin Long:
Set families with a forbidden pattern. Eur. J. Comb. 62: 183-196 (2017) - 2016
- [j9]Peter Keevash, Eoin Long:
On the Normalized Shannon Capacity of a Union. Comb. Probab. Comput. 25(5): 766-767 (2016) - 2015
- [j8]Eoin Long:
Large unavoidable subtournaments. Electron. Notes Discret. Math. 49: 723-728 (2015) - [j7]Asaf Ferber, Gal Kronenberg, Eoin Long:
Packing, Counting and Covering Hamilton cycles in random directed graphs. Electron. Notes Discret. Math. 49: 813-819 (2015) - [j6]Eoin Long:
Forbidding intersection patterns between layers of the cube. J. Comb. Theory A 134: 103-120 (2015) - 2014
- [j5]Imre Leader, Eoin Long:
Tilted Sperner families. Discret. Appl. Math. 163: 194-198 (2014) - [j4]Imre Leader, Eoin Long:
Forbidding a set difference of size 1. Discret. Appl. Math. 169: 219-224 (2014) - [j3]Imre Leader, Eoin Long:
Long geodesics in subgraphs of the cube. Discret. Math. 326: 29-33 (2014) - [i1]Peter Keevash, Eoin Long:
Frankl-Rödl type theorems for codes and permutations. CoRR abs/1402.6294 (2014) - 2013
- [j2]Eoin Long:
Long paths and cycles in subgraphs of the cube. Comb. 33(4): 395-428 (2013) - [j1]Ben Barber, Eoin Long:
Random Walks on Quasirandom Graphs. Electron. J. Comb. 20(4): 25 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
