![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Combinatorial Theory, Series B, Volume 124
Volume 124, May 2017
- Rajko Nenadov
, Yury Person
, Nemanja Skoric, Angelika Steger:
An algorithmic framework for obtaining lower bounds for random Ramsey problems. 1-38 - Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le
, Martin Merker
, Stéphan Thomassé
:
A proof of the Barát-Thomassen conjecture. 39-55 - A. Nicholas Day, J. Robert Johnson:
Multicolour Ramsey numbers of odd cycles. 56-63 - József Balogh, Allan Lo
, Theodore Molla:
Transitive triangle tilings in oriented graphs. 64-87 - Daniela Kühn, Deryk Osthus, Timothy Townsend, Yi Zhao:
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles. 88-127 - Laurent Beaudou
, Florent Foucaud, Reza Naserasr:
Homomorphism bounds and edge-colourings of K4-minor-free graphs. 128-164 - Jonathan Tidor
:
Dense binary PG(t - 1, 2)-free matroids have critical number t - 1 or t. 165-179
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.