Articles de revista: Enviaments recents

Ara es mostren els items 1-12 de 104

    • Proper colouring Painter–Builder game 

      Bednarska-Bzdega, Malgorzata; Krivelevich, Michael; Mészáros, Viola; Requile, Clement (2018-03)
      Article
      Accés obert
      We consider the following two-player game, parametrised by positive integers and . The game is played between Painter and Builder, alternately taking turns, with Painter moving first. The game starts with the empty graph ...

    • Largest component of subcritical random graphs with given degree sequence 

      Coulson, Matthew John; Perarnau Llobet, Guillem (Project Euclid, 2023-02)
      Article
      Accés obert
      We study the size of the largest component of two models of random graphs with prescribed degree sequence, the configuration model (CM) and the uniform model (UM), in the (barely) subcritical regime. For the CM, we give ...

    • Variants of plane diameter completion 

      Golovach, Petr; Requile, Clement; Thilikos, Dimitrios M. (2015-11-19)
      Article
      Accés obert
      The Plane Diameter Completion problem asks, given a plane graph G and a positive integer d, if it is a spanning subgraph of a plane graph H that has diameter at most d. We examine two variants of this problem where the ...

    • Enumeration of rooted 3-connected bipartite planar maps 

      Noy Serrano, Marcos; Requile, Clement; Rué Perna, Juan José (2024-03-07)
      Article
      Accés obert
      We provide the first solution to the problem of counting rooted 3-connected bipartite planar maps. Our starting point is the enumeration of bicoloured planar maps according to the number of edges and monochromatic edges, ...

    • Rankings in directed configuration models with heavy tailed in-degrees 

      Cai, Xing Shi; Caputo, Pietro; Perarnau Llobet, Guillem; Quattropani, Matteo (2023-12-01)
      Article
      Accés obert
      We consider the extremal values of the stationary distribution of sparse directed random graphs with given degree sequences and their relation to the extremal values of the in-degree sequence. The graphs are generated by ...

    • Homomorphisms between graphs embedded in surfaces 

      Garijo Royo, Delia; Goodall, Andrew; Vena Cros, Lluís (Elsevier, 2024-05)
      Article
      Accés obert
      We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that ...

    • Marked graphs and the chromatic symmetric function 

      Aliste Prieto, José; Mier Vinué, Anna de; Orellana, Rosa; Zamora Ponce, José (2023-09-30)
      Article
      Accés obert
      The 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 ...

    • Speeding up random walk mixing by starting from a uniform vertex 

      Espuny Díaz, Alberto; Morris, Patrick; Perarnau Llobet, Guillem; Serra Albó, Oriol (Project Euclid, 2024-01-01)
      Article
      Accés obert
      The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the ...

    • On additive MDS codes with linear projections 

      Adriaensen, Sam; Ball, Simeon Michael (Elsevier, 2023-10-01)
      Article
      Accés obert
      We support some evidence that a long additive MDS code over a finite field must be equivalent to a linear code. More precisely, let C be an -linear MDS code over . If , , , and C has three coordinates from which its ...

    • The diameter of the directed configuration model 

      Cai, Xing Shi; Perarnau Llobet, Guillem (2023-02-01)
      Article
      Accés obert
      We show that the diameter of the directed configuration model with n vertices rescaled by log n converges in probability to a constant. Our assumptions are the convergence of the in- and out-degree of a uniform random ...

    • Approximation and decomposition in lattices of clutters 

      Martí Farré, Jaume; Mier Vinué, Anna de (2023-08-01)
      Article
      Accés obert
      A clutter on O is a family of subsets of O that are incomparable under inclusion. Given a collection S of clutters on O and another clutter ¿ on O, we study the problem of approximating and decomposing ¿ in terms of the ...

    • De la teoria de grafs clàssica a l’anàlisi de les grans xarxes 

      Rué Perna, Juan José (2023-12-21)
      Article
      Accés obert
      Actualment la teoria de grafs té un paper fonamental tant en les matemà-tiques pures com en les seves aplicacions en moltes branques del coneixement. Enaquest article recorrerem l’evolució de l’àrea de recerca partint del ...