Author/Creator: Sudakov, Benny - British Library Electronic Legal Deposit Catalogue-Journal Issues and Articles Search Results

Author/Creator Sudakov, Benny

1. 3‐Color bipartite Ramsey number of cycles and paths. Issue 4 (7th May 2019)

Authors:: Bucić, Matija; Letzter, Shoham; Sudakov, Benny
Journal:: Journal of graph theory
Issue:: Volume 92:Issue 4(2019)
Page Start:: 445
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

2. A Construction of Almost Steiner Systems. Issue 11 (10th November 2013)

Authors:: Ferber, Asaf; Hod, Rani; Krivelevich, Michael; Sudakov, Benny
Journal:: Journal of combinatorial designs
Issue:: Volume 22:Issue 11(2014:Nov.)
Page Start:: 488
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

3. Acyclic subgraphs of tournaments with high chromatic number. Issue 2 (5th January 2021)

Authors:: Fox, Jacob; Kwan, Matthew; Sudakov, Benny
Journal:: Bulletin of the London Mathematical Society
Issue:: Volume 53:Issue 2(2021)
Page Start:: 619
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

4. Asymptotics in percolation on high‐girth expanders. Issue 4 (6th January 2020)

Authors:: Krivelevich, Michael; Lubetzky, Eyal; Sudakov, Benny
Journal:: Random structures & algorithms
Issue:: Volume 56:Issue 4(2020)
Page Start:: 927
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

5. Bounded colorings of multipartite graphs and hypergraphs. (December 2017)

Authors:: Kamčev, Nina; Sudakov, Benny; Volec, Jan
Journal:: European journal of combinatorics
Issue:: Volume 66(2017)
Page Start:: 235
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

6. Clique minors in graphs with a forbidden subgraph. Issue 3 (16th August 2021)

Authors:: Bucić, Matija; Fox, Jacob; Sudakov, Benny
Journal:: Random structures & algorithms
Issue:: Volume 60:Issue 3(2022)
Page Start:: 327
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

7. Compatible Hamilton cycles in random graphs1. Issue 3 (15th February 2016)

Authors:: Krivelevich, Michael; Lee, Choongbum; Sudakov, Benny
Journal:: Random structures & algorithms
Issue:: Volume 49:Issue 3(2016)
Page Start:: 533
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

8. Cores of random graphs are born Hamiltonian. Issue 1 (3rd March 2014)

Authors:: Krivelevich, Michael; Lubetzky, Eyal; Sudakov, Benny
Journal:: Proceedings of the London Mathematical Society
Issue:: Volume 109:Issue 1(2014:Jul.)
Page Start:: 161
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

9. Counting Hamilton cycles in sparse random directed graphs. Issue 4 (18th October 2018)

Authors:: Ferber, Asaf; Kwan, Matthew; Sudakov, Benny
Journal:: Random structures & algorithms
Issue:: Volume 53:Issue 4(2018)
Page Start:: 592
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

10. Counting Hamilton Decompositions of Oriented Graphs. (16th May 2017)

Authors:: Ferber, Asaf; Long, Eoin; Sudakov, Benny
Journal:: International mathematics research notices
Issue:: Volume 2018:Number 22(2018)
Page Start:: 6908
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗