Combinatorics, Probability & Computing

339	--	351	Malgorzata Bednarska. On Biased Positional Games
353	--	364	Tuhao Chen, E. Seneta. Lower Bounds for the Probability of Intersection of Several Unions of Events
365	--	373	Vlado Dancík. Common Subsequences and Supersequences and their Expected Length
375	--	386	Thomas Emden-Weinert, Stefan Hougardy, Bernd Kreuter. Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
387	--	396	Petros Hadjicostas. The Asymptotic Proportion of Subdivisions of a 2×2 Table that Result in Simpson s Paradox
397	--	401	Olle Häggström. On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs
403	--	412	Yahya Ould Hamidoune, Oscar Ordaz, Asdrubal Ortuño. On a Combinatorial Theorem of Erdös, Ginzburg and Ziv
413	--	422	Chris Jagger. Distant Vertex Partitions of Graphs
423	--	436	Tomasz Luczak, Vojtech Rödl, Endre Szemerédi. Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
437	--	449	Brendan D. McKay, Robert W. Robinson. Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
451	--	463	Petr Savický. Complexity and Probability of Some Boolean Formulas
465	--	483	Kyle Siegrist. Expected Value Expansions in Random Subgraphs with Applications to Network Reliability
485	--	497	Haidong Wu. On Vertex-Triads in 3-Connected Binary Matroids

External Links