Exploració per autor "Perarnau Llobet, Guillem"
Ara es mostren els items 20-39 de 43
-
Large subgraphs without short cycles
(2015-01-06)
Article
Accés obertWe study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs with m edges, what is the smallest size f(m, F) of a largest F–free subgraph? ii) Among all graphs with minimum degree d ... -
Largest component of subcritical random graphs with given degree sequence
(Project Euclid, 2023-02)
Article
Accés obertWe 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 ... -
Local convergence and stability of tight bridge-addable classes
(Canadian Mathematical Society, 2020-06-01)
Article
Accés restringit per política de l'editorialA class of graphs is bridge-addable if given a graph G in the class, any graph obtained by adding an edge between two connected components of G is also in the class. The authors recently proved a conjecture of McDiarmid, ... -
Matchings in random biregular bipartite graphs
(2013-03-24)
Article
Accés obertWe study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdös and Rényi about perfect matchings in random ... -
On the number of coloured triangulations of d-manifolds
(2020-03-11)
Article
Accés obertWe give superexponential lower and upper bounds on the number of coloured d-dimensional triangulations whose underlying space is an oriented manifold, when the number of simplices goes to infinity and d=3 is fixed. In the ... -
On the relation between graph distance and Euclidean distance in random geometric graphs
(2016-09-01)
Article
Accés obertGiven any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean distance and by dE(u, v) their graph distance. The problem of finding upper bounds on dG(u, v) conditional on dE(u, v) ... -
On the tree depth of random graphs
(2010)
Text en actes de congrés
Accés restringit per política de l'editorialThe tree-depth of a graph G is a parameter that plays a crucial role in the theory of bounded expansion classes and has been introduced under numerous names. We describe the asymptotic behaviour of this parameter in the ... -
On the treewidth and related parameters of random geometric graphs
(2017-06-22)
Article
Accés restringit per política de l'editorialWe give asymptotically exact values for the treewidth tw(G) of a random geometric graph G ¿ G(n, r) in [0, v n] 2 . More precisely, let rc denote the threshold radius for the appearance of the giant component in G(n, r). ... -
Overlapping community search for social networks
(IEEE Press. Institute of Electrical and Electronics Engineers, 2010)
Text en actes de congrés
Accés obertFinding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes, real-world datasets suggest the presence ... -
Percolation on random graphs with a fixed degree sequence
(2022-01-04)
Article
Accés obertWe consider bond percolation on random graphs with given degrees and bounded average degree. In particular, we consider the order of the largest component after the random deletion of the edges of such a random graph. We ... -
Probabilistic methods and coloring problems in graphs
(Universitat Politècnica de Catalunya, 2010-06)
Projecte Final de Màster Oficial
Accés obertAquest projecte està dedicat a estudiar el k-èssim nombre cromàtic generalitzat que sorgeix de les descomposicions Low Tree--Depth en grafs usant mètodes probabilístics.. Una extensió natural del nombre cromàtic d'un graf ... -
Rainbow factors in hypergraphs
(2020-05-01)
Article
Accés obertFor any r-graph H, we consider the problem of finding a rainbow H-factor in an r-graph G with large minimum l-degree and an edge-colouring that is suitably bounded. We show that the asymptotic degree threshold is the same ... -
Rainbow matchings in Dirac bipartite graphs
(2019-01-15)
Article
Accés obertWe show the existence of rainbow perfect matchings in µn-bounded edge colorings of Dirac bipartite graphs, for a sufficiently small µ¿>¿0. As an application of our results, we obtain several results on the existence of ... -
Rainbow perfect matchings in r-partite graph structures
(2016-10-03)
Article
Accés obertA matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdos and Spencer on the existence of rainbow perfect matchings in the complete bipartite ... -
Rainbow spanning subgraphs in bounded edge–colourings of graphs with large minimum degree
(2017-08-01)
Article
Accés obertWe study the existence of rainbow perfect matching and rainbow Hamiltonian cycles in edge–colored graphs where every color appears a bounded number of times. We derive asymptotically tight bounds on the minimum degree of ... -
Random combinatorial structures with low dependencies : existence and enumeration
(Universitat Politècnica de Catalunya, 2013-10-01)
Tesi
Accés obertEn aquesta tesi s'estudien diferents problemes en el camp de la combinatòria i la teoria de grafs, utilitzant el mètode probabilístic. Aquesta tècnica, introduïda per Erdős , ha esdevingut una eina molt potent per tal de ... -
Random subgraphs make identification affordable
(2017-01-02)
Article
Accés obertAn identifying code of a graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have small domination number, this is not the ... -
Rankings in directed configuration models with heavy tailed in-degrees
(2023-12-01)
Article
Accés obertWe 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 ... -
Speeding up random walk mixing by starting from a uniform vertex
(Project Euclid, 2024-01-01)
Article
Accés obertThe 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 ... -
TEORIA DE GRAFS | FINAL
(Universitat Politècnica de Catalunya, 2024-01-12)
Examen
Accés restringit a la comunitat UPC
