default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Robert Johnson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j19]J. Robert Johnson, Belinda Wickes:
Shattering k-sets with Permutations. Order 41(2): 419-436 (2024)- 2023
- [j18]Barnabás Janzer
, J. Robert Johnson, Imre Leader:
Partial Shuffles by Lazy Swaps. SIAM J. Discret. Math. 37(4): 2544-2557 (2023) - 2022
- [j17]Natalie C. Behague, J. Robert Johnson:
Synchronizing Times for $k$-sets in Automata. Electron. J. Comb. 29(3) (2022) - 2020
- [j16]J. Robert Johnson, Trevor Pinto:
The $Q_2$-Free Process in the Hypercube. Electron. J. Comb. 27(4): 4 (2020) - [j15]J. Robert Johnson, Imre Leader, Eoin Long:
Correlation for permutations. J. Comb. Theory A 175: 105260 (2020) - 2017
- [j14]J. Robert Johnson, Imre Leader, Mark Walters:
Transitive Avoidance Games. Electron. J. Comb. 24(1): 1 (2017) - [j13]J. Robert Johnson, Trevor Pinto:
Saturated Subgraphs of the Hypercube. Comb. Probab. Comput. 26(1): 52-67 (2017) - [j12]A. Nicholas Day, J. Robert Johnson:
Multicolour Ramsey numbers of odd cycles. J. Comb. Theory B 124: 56-63 (2017) - 2015
- [j11]J. Robert Johnson, Imre Leader, Paul A. Russell:
Set Systems Containing Many Maximal Chains. Comb. Probab. Comput. 24(3): 480-485 (2015) - 2013
- [j10]J. Robert Johnson, Klas Markström:
Turán and Ramsey Properties of Subcube Intersection Graphs. Comb. Probab. Comput. 22(1): 55-70 (2013) - 2011
- [j9]J. Robert Johnson:
An Inductive Construction for Hamilton Cycles in Kneser Graphs. Electron. J. Comb. 18(1) (2011) - 2010
- [j8]J. Robert Johnson, John M. Talbot:
Vertex Turán problems in the hypercube. J. Comb. Theory A 117(4): 454-465 (2010) - [j7]Rahil Baber, J. Robert Johnson, John M. Talbot:
The minimal density of triangles in tripartite graphs. LMS J. Comput. Math. 13: 388-413 (2010) - [j6]Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters:
Random majority percolation. Random Struct. Algorithms 36(3): 315-340 (2010) - 2009
- [j5]J. Robert Johnson:
Universal cycles for permutations. Discret. Math. 309(17): 5264-5270 (2009) - 2008
- [j4]J. Robert Johnson, John M. Talbot:
G-Intersection Theorems for Matchings and Other Graphs. Comb. Probab. Comput. 17(4): 559-575 (2008) - 2004
- [j3]J. Robert Johnson:
A Disproof of the Fon-der-Flaass Conjecture. Comb. Probab. Comput. 13(2): 195-201 (2004) - [j2]J. Robert Johnson:
Long cycles in the middle two layers of the discrete cube. J. Comb. Theory A 105(2): 255-271 (2004) - [j1]J. Robert Johnson, Henry A. Kierstead:
Explicit 2-Factorisations of the Odd Graph. Order 21(1): 19-27 (2004)
Informal and Other Publications
- 2020
- [i1]Natalie C. Behague, J. Robert Johnson:
Synchronizing Times for k-sets in Automata. CoRR abs/2008.12166 (2020)
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-07 22:08 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:
