1. A Density Corrádi–Hajnal Theorem. (1st August 2015) Authors: Allen, Peter; Böttcher, Julia; Hladký, Jan; Piguet, Diana Journal: Canadian journal of mathematics Issue: Volume 67:Number 4(2015) Page Start: 721 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Extremal Even Polygonal Chains on Wiener Numbers. (19th October 2020) Authors: Cao, Yuefen; Yang, Weiling; Zhang, Fuji Journal: Polycyclic aromatic compounds Issue: Volume 40:Number 5(2020) Page Start: 1616 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Making Kr+1-free graphs r-partite. (10th July 2021) Authors: Balogh, József; Clemen, Felix Christian; Lavrov, Mikhail; Lidický, Bernard; Pfender, Florian Journal: Combinatorics, probability and computing Issue: Volume 30:Number 4(2021) Page Start: 609 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Minimizing the number of 5-cycles in graphs with given edge-density. (9th January 2020) Authors: Bennett, Patrick; Dudek, Andrzej; Lidický, Bernard; Pikhurko, Oleg Journal: Combinatorics, probability and computing Issue: Volume 29:Number 1(2020) Page Start: 44 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Minimizing the Number of Triangular Edges. (14th August 2017) Authors: GRUSLYS, VYTAUTAS; LETZTER, SHOHAM Journal: Combinatorics, probability and computing Issue: Volume 27:Number 4(2018) Page Start: 580 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. More about sparse halves in triangle-free graphs. (1st January 2022) Authors: Razborov, A. A. Journal: Sbornik Issue: Volume 213:Number 1(2022) Page Start: 109 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Saturated Graphs of Prescribed Minimum Degree. (7th December 2016) Authors: DAY, A. NICHOLAS Journal: Combinatorics, probability and computing Issue: Volume 26:Number 2(2017:Mar.) Page Start: 201 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. The bandwidth theorem for locally dense graphs. (4th November 2020) Authors: Staden, Katherine; Treglown, Andrew Journal: Forum of mathematics Issue: Volume 8(2020) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE. (20th April 2020) Authors: LIU, HONG; PIKHURKO, OLEG; STADEN, KATHERINE Journal: Forum of mathematics Issue: Volume 8(2020) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours. (31st July 2017) Authors: KEEVASH, PETER; LOCHET, WILLIAM Journal: Combinatorics, probability and computing Issue: Volume 26:Number 6(2017:Nov.) Page Start: 886 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗