On Six Problems Posed by Jarik Nešetřil

[1]  Jaroslav Nesetril,et al.  Minimal asymmetric graphs of induced length 4 , 1992, Graphs Comb..

[2]  W. T. Gowers,et al.  Hypergraph regularity and the multidimensional Szemerédi theorem , 2007, 0710.3032.

[3]  Jan Kratochvíl,et al.  Representing graphs by disks and balls (a survey of recognition-complexity results) , 2001, Discret. Math..

[4]  William T. Trotter,et al.  Induced matchings in cubic graphs , 1993, J. Graph Theory.

[5]  Vojtech Rödl,et al.  Regularity Lemma for k‐uniform hypergraphs , 2004, Random Struct. Algorithms.

[6]  W. T. Gowers,et al.  A new proof of Szemerédi's theorem , 2001 .

[7]  Pavol Hell,et al.  Universality of A-mote Graphs , 1993, Eur. J. Comb..

[8]  P. Seymour,et al.  The Strong Perfect Graph Theorem , 2002, math/0212070.

[9]  R. Schelp,et al.  THE STRONG CHROMATIC INDEX OF GRAPHS , 1990 .

[10]  Jan Kratochvíl,et al.  On intersection representations of co-planar graphs , 1998, Discret. Math..

[11]  Noga Alon,et al.  Long cycles in critical graphs , 2000 .

[12]  R. C. Read,et al.  Maximal Circuits in Critical Graphs , 1957 .

[14]  V. Rödl,et al.  The counting lemma for regular k-uniform hypergraphs , 2006 .

[15]  Zsolt Tuza,et al.  Induced matchings in bipartite graphs , 1989, Discret. Math..

[16]  Piotr Wójcik,et al.  On automorphisms of digraphs without symmetric cycles , 1996 .

[17]  H. Furstenberg.  Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions , 1977 .

[18]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

[19]  Neil Hindman,et al.  Triangle Free Sets and Arithmetic Progressions - Two Pisier Type Problems , 2002, Electron. J. Comb..

[20]  Lars Døvling Anderson.  The strong chromatic index of a cubic graph is at most 10 , 1992 .

[21]  Christoph Ambühl,et al.  The Clique Problem in Intersection Graphs of Ellipses and Triangles , 2005, Theory of Computing Systems.

[22]  Subhash Suri,et al.  Label placement by maximum independent set in rectangles , 1998, CCCG.

[23]  David G. Kirkpatrick,et al.  Unit disk graph recognition is NP-hard , 1998, Comput. Geom..

[24]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[25]  Zsolt Tuza,et al.  The maximum number of edges in 2K2-free graphs of bounded degree , 1990, Discret. Math..

[26]  Klaus Jansen,et al.  Polynomial-Time Approximation Schemes for Geometric Intersection Graphs , 2005, SIAM J. Comput..

[27]  G. Dirac.  On the structure of k-chromatic graphs , 1967, Mathematical Proceedings of the Cambridge Philosophical Society.

[28]  Nabil H. Mustafa,et al.  Independent Set of Intersection Graphs of Convex Objects in 2D , 2004, SWAT.

[29]  Bruce A. Reed,et al.  A Bound on the Strong Chromatic Index of a Graph, , 1997, J. Comb. Theory, Ser. B.

[30]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[31]  J. Kratochvil,et al.  Intersection Graphs of Segments , 1994, J. Comb. Theory, Ser. B.

[32]  Hamed Hatami.  Random cubic graphs are not homomorphic to the cycle of size 7 , 2005, J. Comb. Theory, Ser. B.

[33]  Bjarne Toft,et al.  On critical subgraphs of colour-critical graphs , 1974, Discret. Math..

[34]  Michael Stiebitz,et al.  Subgraphs of colour-critical graphs , 1987, Comb..

[35]  Paul Erdös,et al.  On Some Sequences of Integers , 1936 .

[36]  Alexandr V. Kostochka,et al.  Colorings and homomorphisms of degenerate and bounded degree graphs , 2001, Discret. Math..

[37]  M. Middendorf,et al.  The max clique problem in classes of string-graphs , 1992, Discret. Math..

[38]  Johann Hurink,et al.  A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs , 2004, WG.

[39]  J. Nesetril.  ASPECTS OF STRUCTURAL COMBINATORICS (Graph Homomorphisms and Their Use) , 1999 .

[40]  Paul Erdös,et al.  On Pisier Type Problems and Results (Combinatorial Applications to Number Theory) , 1990 .

[41]  Heinz-Jürgen Voss.  Graphs with prescribed maximal subgraphs and critical chromatic graphs , 1977 .

[42]  John B. Kelly,et al.  PATHS AND CIRCUITS IN CRITICAL GRAPHS. , 1954 .

[43]  G. A. Dirac,et al.  Circuits in critical graphs , 1955 .

[44]  Jaroslav Nešetřil,et al.  A congruence theorem for asymmetric trees , 1971 .

[45]  Jaroslav Nesetril,et al.  The complexity of H-colouring of bounded degree graphs , 2000, Discret. Math..

[46]  Gilles Pisier.  Arithmetic characterizations of Sidon sets , 1983 .

[47]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[48]  Gert Sabidussi.  Clumps, minimal asymmetric graphs, and involutions , 1991, J. Comb. Theory, Ser. B.

[49]  Mohammad Mahdian.  The strong chromatic index of C 4 -free graphs , 2000 .