págs. 209-219
págs. 220-225
Cops and robbers in a random graph
Béla Bollobás, Gábor Kun, Imre Leader
págs. 226-236
Zarankiewicz's Conjecture is finite for each fixed m
Robin Christian, R. Bruce Richter, Gelasio Salazar
págs. 237-247
Flow-cut gaps for integer and fractional multiflows
Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel
págs. 248-273
Classes of locally finite ubiquitous graphs
Thomas Andreae
págs. 274-290
Matchings in 3-uniform hypergraphs
Daniela Kühn, Deryk Osthus, Andrew Treglown
págs. 291-305
On the connectivity of random graphs from addable classes
Mihyun Kang, Konstantinos Panagiotou
págs. 306-312
© 2008-2024 Fundación Dialnet · Todos los derechos reservados