Now showing items 1-20 of 27

  • An involution on bicubic maps and beta(0,1)-trees 

    Claesson, Anders; Kitaev, Sergey; Mier Vinué, Anna de (2015)
    Article
    Open Access
    Bicubic maps are in bijection with (0 ; 1)-trees. We introduce two new ways of decomposing (0 ; 1)-trees. Using this we de ne an endofunc- tion on (0 ; 1)-trees, and thus also on bicubic maps. We show that ...
  • A solution to the tennis ball problem 

    Mier Vinué, Anna de; Noy Serrano, Marcos (2005)
    Article
    Open Access
    We present a complete solution to the so-called tennis ball problem, which is equivalent to counting the number of lattice paths in the plane that use North and East steps and lie between certain boundaries. The solution ...
  • Completion and decomposition of a clutter into representable matroids 

    Martí Farré, Jaume; Mier Vinué, Anna de (Elsevier, 2015-05-01)
    Article
    Open Access
    This paper deals with the question of completing a monotone increasing family of subsets Gamma of a finite set Omega to obtain the linearly dependent subsets of a family of vectors of a vector space. Specifically, we prove ...
  • Extensions and presentations of transversal matroids 

    Bonin, Joseph; Mier Vinué, Anna de (2015-11-02)
    Article
    Open Access
    A 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 

    Bonin, Joseph; Mier Vinué, Anna de (2006)
    Article
    Open Access
    This 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 

    Huemer, Clemens; Mier Vinué, Anna de (2015-08-01)
    Article
    Open Access
    This 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 ...
  • MATEMÀTICA DISCRETA 

    Mier Vinué, Anna de (Universitat Politècnica de Catalunya, 2014-07-04)
    Exam
    Restricted access to the UPC academic community
  • MATEMÀTICA DISCRETA 

    Mier Vinué, Anna de (Universitat Politècnica de Catalunya, 2015-06-04)
    Exam
    Restricted access to the UPC academic community
  • MATEMÀTICA DISCRETA 

    Mier Vinué, Anna de (Universitat Politècnica de Catalunya, 2015-06-04)
    Exam
    Restricted access to the UPC academic community
  • MATEMÀTICA DISCRETA 

    Mier Vinué, Anna de (Universitat Politècnica de Catalunya, 2015-04-09)
    Exam
    Restricted access to the UPC academic community
  • MATEMÀTICA DISCRETA 

    Mier Vinué, Anna de (Universitat Politècnica de Catalunya, 2015-07-03)
    Exam
    Restricted access to the UPC academic community
  • MATEMÀTICA DISCRETA 

    Mier Vinué, Anna de (Universitat Politècnica de Catalunya, 2013-07-02)
    Exam
    Restricted access to the UPC academic community
  • MATEMÀTICA DISCRETA 

    Mier Vinué, Anna de (Universitat Politècnica de Catalunya, 2014-03-27)
    Exam
    Restricted access to the UPC academic community
  • MATEMÀTICA DISCRETA 

    Mier Vinué, Anna de (Universitat Politècnica de Catalunya, 2014-06-04)
    Exam
    Restricted access to the UPC academic community
  • MATEMÀTICA DISCRETA 

    Mier Vinué, Anna de (Universitat Politècnica de Catalunya, 2014-06-04)
    Exam
    Restricted access to the UPC academic community
  • MATEMÀTICA DISCRETA 

    Mier Vinué, Anna de (Universitat Politècnica de Catalunya, 2013-04-02)
    Exam
    Restricted access to the UPC academic community
  • MATEMÀTICA DISCRETA 

    Mier Vinué, Anna de (Universitat Politècnica de Catalunya, 2013-06-04)
    Exam
    Restricted access to the UPC academic community
  • MATEMÀTICA DISCRETA 

    Mier Vinué, Anna de (Universitat Politècnica de Catalunya, 2013-06-04)
    Exam
    Restricted access to the UPC academic community
  • On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs 

    Aliste Prieto, José; Zamora, José; Mier Vinué, Anna de (2018-07)
    Article
    Open Access
    In 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 

    Mier Vinué, Anna de; Noy Serrano, Marcos (2005)
    Article
    Restricted access - publisher's policy
    A 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 ...