Structural and extremal properties of graphs and hypergraphs
Ramsey and anti-Ramsey structures in deterministic and random graphs
Problems of sorting permutations by fragmentation-weighted operations
| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Univ Sao Paulo, Inst Matemat & Estat, Dept Ciencia Comp, BR-05508090 Sao Paulo - Brazil
[2] Ecole Polytech, CNRS, UMR 7161, Lab Informat LIX, F-91128 Palaiseau - France
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | ELECTRONIC JOURNAL OF COMBINATORICS; v. 20, n. 1 JAN 7 2013. |
| Web of Science Citations: | 6 |
| Abstract | |
The age of each countable homogeneous permutation forms a Ramsey class. Thus, there are five countably infinite Ramsey classes of permutations. (AU) | |
| FAPESP's process: | 09/17831-7 - Embedding and packing problems in extremal graph theory |
| Grantee: | Julia Boettcher |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |