Graphs, Hypergraphs, and Computing - Preprint series

00 Approximate Counting of Matchings in (3,3)-Hypergraphs - (0920001) - Andrzej Dudek, Marek Karpinski, Andrzej Ruci?ski, Edyta Szyma?ska

01 Simple containers for simple hypergraphs - David Saxton, Andrew Thomason

02 Combinatorial Conditions for the Unique Completability of Low Rank Matrices - Bill Jackson, Tibor Jordan, Shin-Ichi Tanigawa

03 First order convergence and roots - (1403.3049) - Demetres Christofides, Daniel Kral

04 A density Corradi--Hajnal Theorem - ( arXiv:14) - Peter Allen, Julia Boettcher, Jan Hladky, Diana Piguet

05 Infinite dimensional finitely forcible graphon - (1404.2743) - Roman Glebov, Tereza Klimosova, Daniel Kral

06 Cycles in triangle-free graphs of large chromatic number - (1404.4544) - Alexandr Kostochka, Benny Sudakov, Jacques Verstraete

07 Packing six T-joins in plane graphs - (1009.5912) - Zdenek Dvorak, Ken-ichi Kawarabayashi, Daniel Kral

08 ON THE CORRADI-HAJNAL THEOREM AND A QUESTION OF DIRAC - Henry Kierstead, Alexandr Kostochka, Elyse Yeager

09 Deciding the Bell number for hereditary graph properties - Aistis Atminas, Andrew Collins, Jan Foniok, Vadim Lozin

10 The asymptotic complexity of matrix reduction over finite fields - (1406.5826) - Demetres Christofides

11 The phase transition in site percolation on pseudo-random graphs - (arXiv:140) - Michael Krivelevich

12 The $(2k-1)$-connected multigraphs with at most $k-1$ disjoint cycles - Henry Kierstead, Alexandr Kostochka, Elyse Yeager

13 An alternative proof of the linearity of the size-Ramsey number of paths - Andrzej Dudek, Pawel Pralat

14 Acquaintance time of random graphs near connectivity threshold - Andrzej Dudek, Pawel Pralat

15 A characterisation of the generic rigidity of 2-dimensional point-line frameworks - Bill Jackson, John Owen

16 An exponential-type upper bound for Folkman numbers - Vojtech Rodl, Andrzej Rucinski, Mathias Schacht

17 On Some Open Questions for Ramsey and Folkman Numbers - Xiaodong Xu, Stanis?aw Radziszowski

18 Edge coloring multigraphs without small dense subsets - Penny Haxell, Henry Kierstead

19 Avoiding tight twins in sequences via entropy compression - Jaros?aw Grytczuk, Jakub Kozik, Bartosz Zaleski

20 The complexity of finding arc-disjoint branching flows - Jørgen Bang-Jensen, Frederic Havet, Anders Yeo

21 Balanced branchings in digraphs - Jørgen Bang-Jensen, Anders Yeo

22 Counting flags in triangle-free digraphs - (0908.2791) - Jan Hladky, Daniel Kral, Serguei Norine

23 On Chromatic Number and Minimum Cut - (1407.8035) - Meysam Alishahi, Hossein Hajiabolhassan

24 Distinguishing graphs by total colourings - Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak

25 On the choice number of complete multipartite graphs with part size four - (1407.3817) - H. A. Kierstead, Andrew Salmon, Ran Wang

26 Solution of Vizing’s Problem on Interchanges for Graphs with Maximum Degree 4 and Related Results - ( arXiv:14) - A. S. Asratian, C. J. Casselgren

27 Hadwiger’s Conjecture for inflations of 3-chromatic graphs - Carl Johan Casselgren, Anders Sune Pedersen

28 Nonrepetitive colorings of line arrangements - Jaros?aw Grytczuk, Karol Kosi?ski, Micha? Zmarz

29 A Note on Vertex Coloring Edge-Weighted Digraphs - Joergen Bang-Jensen, Magnus Halldorsson

30 Restricted cycle factors and arc-decompositions of digraphs - Jørgen Bang-Jensen, Carl Johan Casselgren

31 The minimum number of triangular edges and a symmetrization for multiple graphs - (1411.0771) - Zoltan Furedi, Zeinab Maleki

32 Full subgraphs - Victor Falgas-Ravry, Klas Markström, Jacques Verstraete

33 On 3-uniform hypergraphs without linear cycles - Andras Gyarfas, Ervin Gyori, Miklos Simonovits

34 Linear Turan numbers of linear cycles and cycle-complete Ramsey numbers - (1404.0515) - Tao Jiang, Clayton Collier-Cartaino, Nathan Graber

35 On 3-uniform hypergraphs without a cycle of a given length - (arXiv:141) - Zoltan Furedi, Lale Ozkahya

36 Antistrong digraphs - Jørgen Bang-Jensen, Stephane Bessy, Bill Jackson, Matthias Kriesell

37 Small dense subgraphs of a graph - (1502.0260) - Tao Jiang, Andrew Newman

38 Edge coloring multigraphs without small dense subsets - Penny Haxell, Henry Kierstead

39 Liftings in finite graphs and linkages in infinite graphs - Seongmin Ok, R Bruce Richter, Carsten Thomassen

40 On Connectivity of the Facet Graphs of Simplicial Complexes - (arXiv:150) - Yuri Rabinovich, Ilan Newman

41 Upper bounds on the minimum size of Hamilton saturated hypergraphs - Andrzej Rucinski, Andrzej Zak

42 On the size-ramsey numbers for hypergraphs - Andrzej Dudek, Steven La Fleur, Drhuv Mubayi

43 The choice number or complete multipartite graphs with part size four - H. A. Kierstead, Andrew Salmon, Ran Wang

44 Turan numbers of hypergraph trees - (1505.0321) - Zoltan Furedi, Tao Jiang

45 Manipulative waiters with probabilistic intuition - (arXiv:140) - Malgorzata Bednarska-Bzdega, Dan Hefetz, Michael Krivelevich, Tomasz Luczak

46 A proof of the stability of extremal graphs, Simonovits' stability from Szemeredi's regularity - Zoltan Furedi

47 Problem collection from the IML programme: Graphs, Hypergraphs, and Computing - Klas Markström

48 Embedding the Erdos-Renyi Hypergraph into the Random Regular Hypergraph and Hamiltonicity - Andrzej Dudek, Alan Frieze, Andrzej Rucinski, Matas Sileikis