Zobrazeno 1 - 10
of 131
pro vyhledávání: '"Safe, Martín"'
Autor:
Romero, Pablo, Safe, Martín D.
If $G$ is a simple graph and $\rho\in[0,1]$, the reliability $R_G(\rho)$ is the probability of $G$ being connected after each of its edges is removed independently with probability $\rho$. A simple graph $G$ is a \emph{uniformly most reliable graph}
Externí odkaz:
http://arxiv.org/abs/2303.00813
Lochs' theorem and its generalizations are conversion theorems that relate the number of digits determined in one expansion of a real number as a function of the number of digits given in some other expansion. In its original version, Lochs' theorem
Externí odkaz:
http://arxiv.org/abs/2202.04008
A family of sets is $(p,q)$-intersecting if every nonempty subfamily of $p$ or fewer sets has at least $q$ elements in its total intersection. A family of sets has the $(p,q)$-Helly property if every nonempty $(p,q)$-intersecting subfamily has total
Externí odkaz:
http://arxiv.org/abs/2201.12610
A $(0,1)$-matrix has the consecutive-ones property (C1P) if its columns can be permuted to make the $1$'s in each row appear consecutively. This property was characterised in terms of forbidden submatrices by Tucker in 1972. Several graph classes wer
Externí odkaz:
http://arxiv.org/abs/2103.03795
Publikováno v:
Discrete Applied Mathematics 323 (2022), 43-75
A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the corresponding chords have nonempty intersection. Even though there are diverse
Externí odkaz:
http://arxiv.org/abs/2007.00570
In this paper weighted endpoint estimates for the Hardy-Littlewood maximal function on {the infinite rooted} $k$-ary tree are provided. Motivated by Naor and Tao the following Fefferman-Stein estimate \[ w\left(\left\{ x\in T\,:\,Mf(x)>\lambda\right\
Externí odkaz:
http://arxiv.org/abs/2003.10034
We present formulas to compute the P3-geodetic number, the P3-hull number and the percolation time for a caterpillar, in terms of certain sequences associated with it. In addition, we find a connection between the percolation time of a unit interval
Externí odkaz:
http://arxiv.org/abs/2002.10598
We present some complexity results concerning the problems of covering a graph with $p$ convex sets and of partitioning a graph into $p$ convex sets. The following convexities are considered: digital convexity, monophonic convexity, $P_3$-convexity,
Externí odkaz:
http://arxiv.org/abs/1907.01581
Publikováno v:
Matem\'atica Contempor\^anea, Vol. 46 (2019) 119-128
A $(0,1)$-matrix has the Consecutive Ones Property (C1P) for the rows if there is a permutation of its columns such that the ones in each row appear consecutively. We say a $(0, 1)$-matrix is nested if it has the consecutive ones property for the row
Externí odkaz:
http://arxiv.org/abs/1906.11970
Autor:
Safe, Martín D.
In 1969, Alan Tucker characterized proper circular-arc graphs as those graphs whose augmented adjacency matrices have the circularly compatible ones property. Moreover, he also found a polynomial-time algorithm for deciding whether any given augmente
Externí odkaz:
http://arxiv.org/abs/1906.00321