Exploració per autor "Mier Vinué, Anna de"
Ara es mostren els items 5-24 de 40
-
Extensions and presentations of transversal matroids
(2015-11-02)
Article
Accés obertA transversal matroid MM can be represented by a collection of sets, called a presentation of MM, whose partial transversals are the independent sets of MM. Minimal presentations are those for which removing any element ... -
Lattice path matroids: structural properties
(2006)
Article
Accés obertThis paper studies structural aspects of lattice path matroids. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One of the main results is a characterization of lattice path ... -
Lower bounds on the maximum number of non-crossing acyclic graphs
(2015-08-01)
Article
Accés obertThis paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain ... -
Marked graphs and the chromatic symmetric function
(2023-09-30)
Article
Accés obertThe main result of this paper is the introduction of marked graphs and the marked graph polynomials ( -polynomial) associated with them. These polynomials can be defined via a deletion-contraction operation. These polynomials ... -
MATEMÀTICA DISCRETA
(Universitat Politècnica de Catalunya, 2015-04-09)
Examen
Accés restringit a la comunitat UPC -
MATEMÀTICA DISCRETA
(Universitat Politècnica de Catalunya, 2013-07-02)
Examen
Accés restringit a la comunitat UPC -
MATEMÀTICA DISCRETA
(Universitat Politècnica de Catalunya, 2014-07-04)
Examen
Accés restringit a la comunitat UPC -
MATEMÀTICA DISCRETA
(Universitat Politècnica de Catalunya, 2015-06-04)
Examen
Accés restringit a la comunitat UPC -
MATEMÀTICA DISCRETA
(Universitat Politècnica de Catalunya, 2014-06-04)
Examen
Accés restringit a la comunitat UPC -
MATEMÀTICA DISCRETA
(Universitat Politècnica de Catalunya, 2014-03-27)
Examen
Accés restringit a la comunitat UPC -
MATEMÀTICA DISCRETA
(Universitat Politècnica de Catalunya, 2013-06-04)
Examen
Accés restringit a la comunitat UPC -
MATEMÀTICA DISCRETA
(Universitat Politècnica de Catalunya, 2014-06-04)
Examen
Accés restringit a la comunitat UPC -
MATEMÀTICA DISCRETA
(Universitat Politècnica de Catalunya, 2015-06-04)
Examen
Accés restringit a la comunitat UPC -
MATEMÀTICA DISCRETA
(Universitat Politècnica de Catalunya, 2015-07-03)
Examen
Accés restringit a la comunitat UPC -
MATEMÀTICA DISCRETA
(Universitat Politècnica de Catalunya, 2013-04-02)
Examen
Accés restringit a la comunitat UPC -
MATEMÀTICA DISCRETA
(Universitat Politècnica de Catalunya, 2013-06-04)
Examen
Accés restringit a la comunitat UPC -
On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs
(2018-07)
Article
Accés obertIn this abstract, we construct explicitly, for every k, pairs of non-isomorphic trees with the same restricted U-polynomial; by this we mean that the polynomials agree on terms with degree at most k. The construction is ... -
On matroids determined by their Tutte polynomials
(2005)
Article
Accés restringit per política de l'editorialA matroid is T-unique if it is determined up to isomorphism by its Tutte polynomial. Known T-unique matroids include projective and affine geometries of rank at least four, wheels, whirls, free and binary spikes, and certain ... -
On the evaluation of the Tutte polynomial at the points (1,-1) and (2,-1)
(2010)
Text en actes de congrés
Accés obertC. Merino proved recently the following identity between evaluations of the Tutte polynomial of complete graphs: t($K_{n+2}$; 1,−1) = t($K_n$;2,−1). In this work we extend this result by giving a large class of graphs with ... -
On the maximum number of cycles in outerplanar and series-parallel graph
(2009)
Article
Accés restringit per política de l'editorialLet c(n) be the maximum number of cycles in an outerplanar graph with n vertices. We show that lim $c(n)^{1/n}$ exists and equals β = 1.502837 . . ., where β is a constant related to the recurrence $x_n+1$=1+$x^2_n$, ...
