Horizons of Combinatorics
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, combinatorial geometry as well. The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the con...
Tallennettuna:
| Yhteisötekijä: | |
|---|---|
| Muut tekijät: | , , |
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Sarja: | Bolyai Society Mathematical Studies
17 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Horizons of combinatorics, Ervin Győri, Gyula O.H. Katona, László Lovász (eds.), Berlin, Springer, János Bolyai Mathematical Society, 2008, 1 vol. (280 p.), Bolyai Society mathematical studies, 978-3-540-77199-9 |
Sisällysluettelo:
- Ballot Theorems, Old and New
- Statistical Inference on Random Structures
- Proof Techniques for Factor Theorems
- Erd?s-Hajnal-type Results on Intersection Patterns of Geometric Objects
- Old and New Problems and Results in Ramsey Theory
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
- Subsums of a Finite Sum and Extremal Sets of Vertices of the Hypercube
- Combinatorial Conditions for the Rigidity of Tensegrity Frameworks
- Polygonal Graphs
- Infinite Combinatorics: From Finite to Infinite
- The Random Walk Method for Intersecting Families
- Problems and Results on Colorings of Mixed Hypergraphs
- Random Discrete Matrices.