| Full text | |
| Author(s): |
Fernandes, Cristina G.
[1]
;
Hernandez-Velez, Cesar
[2]
;
de Pina, Jose C.
[1]
;
Alfonsin, Jorge Luis Ramirez
[3]
Total Authors: 4
|
| Affiliation: | [1] Univ Sao Paulo, Inst Matemat & Estat, Sao Paulo - Brazil
[2] Univ Autonoma San Luis Potosi, Fac Ciencias, San Luis Potosi - Mexico
[3] Univ Montpellier, CNRS, IMAG, Montpellier - France
Total Affiliations: 3
|
| Document type: | Journal article |
| Source: | GRAPHS AND COMBINATORICS; v. 35, n. 2, p. 539-550, MAR 2019. |
| Web of Science Citations: | 0 |
| Abstract | |
We present superfactorial and exponential lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graph of generalized Catalan, uniform, and graphic matroids. All lower bounds were obtained by a common general strategy based on counting appropriated cycles of length four in the corresponding matroid basis graph. (AU) | |
| FAPESP's process: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 12/24597-3 - Topological and structural problems in graph theory. |
| Grantee: | César Israel Hernández Vélez |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 15/10323-7 - Matroids and graphs |
| Grantee: | Cristina Gomes Fernandes |
| Support Opportunities: | Research Grants - Visiting Researcher Grant - International |