default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeometry, Structure and Randomness in Combinatorics 2014
- Jirí Matousek, Jaroslav Nesetril, Marco Pellegrini:
Geometry, Structure and Randomness in Combinatorics. Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series 18, Springer 2014, ISBN 978-88-7642-524-0 - Imre Bárány:
Tensors, colours, octahedra. 1-17 - Maria Chudnovsky:
Cliques and stable sets in undirected graphs. 19-25 - Mauro Di Nasso:
A taste of nonstandard methods in combinatorics of numbers. 27-46 - Béla Bollobás, Zoltán Füredi, Ida Kantor, Gyula O. H. Katona, Imre Leader:
A coding problem for pairs of subsets. 47-59 - Jirí Matousek:
String graphs and separators. 61-97 - Jaroslav Nesetril, Patrice Ossona de Mendez
:
On first-order definable colorings. 99-122 - Ryan Schwartz, József Solymosi:
Combinatorial applications of the subspace theorem. 123-140 - Peter Hegarty, Dmitry Zhelezov:
Can connected commuting graphs of finite groups have arbitrarily large diameter? 141-144
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.
last updated on 2026-08-09 23:03 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
