págs. 5-5
págs. 6-6
págs. 7-7
págs. 8-8
Extending a conjecture of Graham and Lovász on the distance characteristic polynomial
Aida Abiad, Boris Brimkov, Sakander Hayat, Antonina P. Khramova, Jack H. Koolen
págs. 11-16
págs. 17-23
Polynomials for marked graphs and the chromatic symmetric function
José Aliste Prieto, Anna de Mier Vinué, Rosa Orellana, José Zamora
págs. 24-30
An analogue of Chvátal’s Hamiltonicity theorem for randomly perturbed graphs
Alexander Allin, Alberto Espuny Díaz
págs. 31-36
págs. 37-41
págs. 42-45
págs. 46-48
Accessible set systems and a conjecture on Cohen-Macaulay binomialedge ideals
Davide Bolognini, Antonio Macchia, Giancarlo Rinaldo, Francesco Strazzanti
págs. 49-53
Logarithmic convergence of projective planes
Márton Borbényi, Panna Fekete, Aranka Hrušková, Ander Lamaison
págs. 54-57
Seymour’s second neighborhood conjecture in arbitrary orientationsof a random graph
Fábio Botler, Phablo F. S. Moura, Tássio Naia
págs. 58-63
Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes
Marie Charlotte Brandenburg, Christian Haase, Ngoc Mai Tran
págs. 64-70
Conway’s fried potato problem: a (quadratic) algorithm leading to anoptimal division for convex polygons
Antonio Cañete, Isabel Fernández, Alberto Márquez
págs. 71-76
Enumeration of chordal planar graphs and maps
Jordi Castellví, Marc Noy Serrano , Clément Requilé
págs. 77-83
Characterizing the extremal families in Erdős-Ko-Rado theorems
Gilad Chase, Neta Dafni, Yuval Filmus, Nathan Lindzey
págs. 84-89
Combinatorics and preservation of conically stable polynomials (Extended abstract)
Giulia Codenotti, Stephan Gardoll, Thorsten Theobald
págs. 90-96
Generalised flatness constants: a framework applied in dimension 2
Giulia Codenotti, Thomas Hall, Johannes Hofscheier
págs. 97-103
págs. 104-109
A parallel between the descriptive complexities of finite groups and Latin square graphs
Anuj Dawar, Danny Vagnozzi
págs. 110-115
On vertex bisection width of random d-regular graphs
Josep Díaz, Öznur Yaşar Diner, Maria Serna, Oriol Serra
págs. 116-122
Sidon-Ramsey & Bh-Ramsey numbers
Manuel A. Espinosa García, Amanda Montejano Cantoral, Edgardo Roldán Pensado, J. David Suárez
págs. 123-127
Powers of Hamilton cycles in graphs perturbed by a random geometric graph
Alberto Espuny Díaz, Joseph Hyde
págs. 128-133
Maximum running times for graph bootstrap percolation processes
David Fabián Cevallos Salas, Patrick Morris, Tibor Szabó
págs. 134-140
Homomorphisms between graphs embedded in surfaces (extended abstract)
Delia Garijo Royo , Andrew Goodall, Lluís Vena Cross
págs. 141-146
págs. 147-152
págs. 153-158
The weighted sum method for multi-objective optimization using Test Sets via Gröbner Bases
José Manuel Jiménez Cobano, Haydee Jiménez Tafur, José María Ucha Enríquez
págs. 159-162
Generalized Permutahedra and Positive Flag Dressians
Michael Joswig, Georg Loho, Dante Luber, Jorge Olarte
págs. 163-168
Common systems of two equations over the binary field
Daniel Král', Ander Lamaison, Péter Pál Pach
págs. 169-173
Linking+SensoGraph: A new graph-based method for sensoryanalysis
Jacob Lahne, David Orden, Katherine Phetxumphou, Marino Tejedor Romero
págs. 174-180
Random projections for the distance geometry problem
Leo Liberti, Benedetto Manca, Pierre Louis Poirion
págs. 181-187
On discrete Borell-Brascamp-Lieb type inequalities for big negative parameters
Eduardo Lucas Marín
págs. 188-192
págs. 193-199
págs. 200-205
Extremal Sidon sets are Fourier uniform, with applications to partition regularity
Miquel Ortega, Sean Prendiville
págs. 206-207
Many regular triangulations and many polytopes
Arnau Padrol, Eva Philippe, Francisco Santos
págs. 211-216
págs. 217-223
New Ramsey multiplicity bounds and search heuristics
Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel, Tibor Szabó
págs. 224-230
págs. 231-236
Generalized Perron roots and solvability of the absolute value equation
Manuel Radons, Josué Tonelli Cueto
págs. 237-242
Normal limiting distributions for systems of linear equations in random sets
Juanjo Rué, Maximilian Wötzel
págs. 243-248
págs. 249-254
A faster algorithm for the two cluster partitioning problem
Francisco Javier Soto, Ana I. Gómez, Domingo Gómez Pérez
págs. 255-260
Cospectral generalized Johnson and Grassmann graphs
Aida Abiad, Jozefien D’haeseleer, Robin Simoens
págs. 263-268
Advances on the 3-color off-diagonal generalized Schurnumbers S(3; k1, k2, k3)
T. Ahmed, J.L. Boza, Pastora Revuelta Marchena , M.I. Sanz
págs. 269-273
On bipartite biregular Moore graphs
Gabriela Araujo-Pardo , Cristina Dalfó Simó , Miguel Ángel Fiol Mora , Nacho López
págs. 274-279
Computation of 2D discrete geometric moments through inclusion-exclusion
Lidija Čomić, Paola Magillo
págs. 280-285
Trees having domination number equal to {K2}-isolation number
Adriana Dapena , Magdalena Lemanska , María José Souto Salorio, Francisco Vazquez Araujo
págs. 286-290
Restrained differential of a graph
Magda Dettlaf, Abel Cabrera Martínez, Magdalena Lemanska , Juan Alberto Rodríguez Velázquez
págs. 290-294
págs. 295-300
The discrete side of Distance Geometry: a focus on the 1-dimensional case
Simon B. Hengeveld, A. Mucherino
págs. 301-305
págs. 306-312
págs. 313-317
págs. 318-323
© 2008-2024 Fundación Dialnet · Todos los derechos reservados