Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Juanjo Rué"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
Erdős and Rényi conjectured in 1960 that the limiting probability $p$ that a random graph with $n$ vertices and $M=n/2$ edges is planar exists. It has been shown that indeed p exists and is a constant strictly between 0 and 1. In this paper we answ
Externí odkaz:
https://doaj.org/article/15b58bf072d447568c095b0bc3b2e160
Autor:
Maximilian Wötzel, Juanjo Rué
Publikováno v:
Gonzalez Herrera, A. (ed.), Discrete Mathematics Days 2022: Santander, Spain, July 4-6,2022, pp. 243-245
Linear Algebra and Its Applications, 649, 122-151
Linear Algebra and Its Applications, 649, pp. 122-151
Linear Algebra and Its Applications, 649, 122-151
Linear Algebra and Its Applications, 649, pp. 122-151
We consider the binomial random set model $[n]_p$ where each element in $\{1,\dots,n\}$ is chosen independently with probability $p:=p(n)$. We show that for essentially all regimes of $p$ and very general conditions for a matrix $A$ and a column vect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9708a6efbab35f8adfbdbd6c810bcfc7
https://hdl.handle.net/2117/385698
https://hdl.handle.net/2117/385698
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, following Bernardi and Bousqu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c85c76697b06da566d8fdb1659cbb58e
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
A well-known conjecture by Lovasz and Plummer from the 1970s asserting that a bridgeless cubic graph has exponentially many perfect matchings was solved in the affirmative by Esperet et al. (Adv. Math. 2011). On the other hand, Chudnovsky and Seymour
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6005ccc7381d04463c73ed720ab86ffd
https://hdl.handle.net/2117/365009
https://hdl.handle.net/2117/365009
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
A set of integers S ⊂ N is an α–strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on α, more specifically if | ( x + w ) − ( y + z ) | ≥ max { x α , y α , z α , w α } for every x , y
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d6a630325fdd6815be4ee44e70afb80
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
We provide precise asymptotic estimates for the number of several classes of labelled cubic planar graphs, and we analyze properties of such random graphs under the uniform distribution. This model was first analyzed by Bodirsky et al. (Random Struct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a5138224b2cc394e67b42f514d56f12
https://hdl.handle.net/2117/189004
https://hdl.handle.net/2117/189004
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
The goal of this paper is to obtain quantitative results on the number and on the size of maximal independent sets and maximal matchings in several block-stable graph classes that satisfy a proper sub-criticality condition. In particular we cover tre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed770f2d8ce78bb8b0bab9e68e834693
https://hdl.handle.net/2117/185282
https://hdl.handle.net/2117/185282
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
Let $k\geq 2$ be a positive integer. We study concentration results for the ordered representation functions $r^{\leq}_k(A,n) = \# \big\{ (a_1 \leq \dots \leq a_k) \in A^k : a_1+\dots+a_k = n \big\}$ and $r^{ 0$ and $\star \in \{\leq,0$. These result
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6dceb4b11bc47d4b7ea24874ad1f022
http://hdl.handle.net/2117/345088
http://hdl.handle.net/2117/345088
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
Let L be subset of { 3 , 4 , … } and let X n , M ( L ) be the number of cycles belonging to unicyclic components whose length is in L in the random graph G ( n , M ) . We find the limiting distribution of X n , M ( L ) in the subcritical regime M =
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33a29adbc65feb4f153046f0ba0e4ef8
This book collects the extended abstracts of the accepted contributions to EuroComb21. A similar book is published at every edition of EuroComb (every two years since 2001) collecting the most recent advances in combinatorics, graph theory, and relat