MD  Matemàtica Discreta
Investigació en els camps de combinatòria enumerativa, combinatòria algebraica i teoria de grafs.
The aim is to carry out research in the fields of enumerative combinatorics, algebraic combinatorics and graph theory.
The aim is to carry out research in the fields of enumerative combinatorics, algebraic combinatorics and graph theory.
Collections

Articles de revista [74]
Recent Submissions

Transformation and decomposition of clutters into matroids
(20170525)
Article
Restricted access  publisher's policyA clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of bases, and its set of hyperplanes are examples of clutters arising from matroids. In this paper we address the question of ... 
On trees with the same restricted Upolynomial and the Prouhet–Tarry–Escott problem
(201706)
Article
Restricted access  publisher's policyThis paper focuses on the wellknown problem due to Stanley of whether two nonisomorphic trees can have the same Upolynomial (or, equivalently, the same chromatic symmetric function). We consider the Ukpolynomial, which ... 
Threshold functions and Poisson convergence for systems of equations in random sets
(20170510)
Article
Restricted access  publisher's policyWe study threshold functions for the existence of solutions to linear systems of equations in random sets and present a unified framework which includes arithmetic progressions, sumfree sets, Bh[g]Bh[g]sets and Hilbert ... 
Corrigendum to"On the limiting distribution of the metric dimension for random forests" [European J. Combin. 49 (2015) 6889]
(20170722)
Article
Restricted access  publisher's policyIn the paper ”On the limiting distribution of the metric dimension for random forests” the metric dimension ß(G) of sparse G(n, p) with p = c/n and c < 1 was studied (Theorem 1.2). In the proof of this theorem, for the ... 
Counting configurationfree sets in groups
(20170101)
Article
Restricted access  publisher's policy© 2017 Elsevier Ltd. We provide asymptotic counting for the number of subsets of given size which are free of certain configurations in finite groups. Applications include sets without solutions to equations in nonabelian ... 
Isolated cycles of critical random graphs
(Society for Industrial and Applied Mathematics (SIAM), 2017)
Conference report
Open AccessConsider the ErdosRenyi random graph G(n, M) built with n vertices and M edges uniformly randomly chosen from the set of n2 edges. Let L be a set of positive integers. For any number of edges M 6n/2 + O(n 2/3 ), we compute ... 
Random strategies are nearly optimal for generalized van der Waerden Games
(20170801)
Article
Restricted access  publisher's policyIn a (1 : q) MakerBreaker game, one of the central questions is to find (or at least estimate) the maximal value of q that allows Maker to win the game. Based on the ideas of Bednarska and Luczak [Bednarska, M., and T. ... 
Enumeration of labeled 4regular planar graphs
(20170801)
Article
Open AccessIn this extended abstract, we present the first combinatorial scheme for counting labeled 4regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function ... 
Counting outerplanar maps
(20170413)
Article
Open AccessA map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of rooted outerplanar maps with respect to the number of edges and vertices. The proofs involve several bijections with lattice ... 
Subgraph statistics in subcritical graph classes
(20170401)
Article
Restricted access  publisher's policyLet H be a fixed graph and math formula a subcritical graph class. In this paper we show that the number of occurrences of H (as a subgraph) in a graph in math formula of order n, chosen uniformly at random, follows a ... 
Location in maximal outerplanar graphs
(2017)
Conference report
Restricted access  publisher's policyIn this work we study the metric dimension and the locationdomination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal ... 
A lower bound for the size of a Minkowski sum of dilates
(20110301)
Article
Open AccessLet A be a finite nonempty set of integers. An asymptotic estimate of the size of the sum of several dilates was obtained by Bukh. The unique known exact bound concerns the sum A + k·A, where k is a prime and A is ...