Now showing items 1-2 of 2

  • On identifying codes in partial linear spaces 

    Araujo-Pardo, Gabriela; Montejano, Luis; Camino, Balbuena; Valenzuela, Juan Carlos (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    Let (P,L, I) be a partial linear space and X ⊆ P ∪ L. Let us denote by (X)I = x∈X{y : yIx} and by [X] = (X)I ∪ X. With this terminology a partial linear space (P,L, I) is said to admit a (1,≤ k)-identifying code if the ...
  • Subdivisions in a bipartite graph 

    Balbuena Martínez, Maria Camino Teófila; Cera, Martín; García-Vázquez, Pedro; Valenzuela, Juan Carlos (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    Given a bipartite graph G with m and n vertices, respectively,in its vertices classes, and given two integers s, t such that 2 ≤ s ≤ t, 0 ≤ m−s ≤ n−t, and m+n ≤ 2s+t−1, we prove that if G has at least mn−(2(m−s)+n−t) edges ...