↓ Skip to main content

The Seventh European Conference on Combinatorics, Graph Theory and Applications

Overview of attention for book
Cover of 'The Seventh European Conference on Combinatorics, Graph Theory and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A problem of Erdős and Sós on 3-graphs
  3. Altmetric Badge
    Chapter 2 An analogue of the Erdős-Ko-Rado theorem for multisets
  4. Altmetric Badge
    Chapter 3 Polynomial gap extensions of the Erdős-Pósa theorem
  5. Altmetric Badge
    Chapter 4 The Erdős-Pósa property for long circuits
  6. Altmetric Badge
    Chapter 5 A hypergraph Turán theorem via Lagrangians of intersecting families
  7. Altmetric Badge
    Chapter 6 Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
  8. Altmetric Badge
    Chapter 7 Fractional and integer matchings in uniform hypergraphs
  9. Altmetric Badge
    Chapter 8 On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
  10. Altmetric Badge
    Chapter 9 Relating ordinary and total domination in cubic graphs of large girth
  11. Altmetric Badge
    Chapter 10 Snarks with large oddness and small number of vertices
  12. Altmetric Badge
    Chapter 11 Non-trivial snarks with given circular chromatic index
  13. Altmetric Badge
    Chapter 12 The graph formulation of the union-closed sets conjecture
  14. Altmetric Badge
    Chapter 13 The union-closed sets conjecture almost holds for almost all random bipartite graphs
  15. Altmetric Badge
    Chapter 14 The robust component structure of dense regular graphs
  16. Altmetric Badge
    Chapter 15 The (Δ, D ) and (Δ, N ) problems in double-step digraphs with unilateral diameter
  17. Altmetric Badge
    Chapter 16 Critical groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
  18. Altmetric Badge
    Chapter 17 Two notions of unit distance graphs
  19. Altmetric Badge
    Chapter 18 An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs
  20. Altmetric Badge
    Chapter 19 On the structure of the group of balanced labelings on graphs
  21. Altmetric Badge
    Chapter 20 The price of connectivity for feedback vertex set
  22. Altmetric Badge
    Chapter 21 A local flow algorithm in bounded degree networks
  23. Altmetric Badge
    Chapter 22 The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
  24. Altmetric Badge
    Chapter 23 A multipartite Hajnal-Szemerédi theorem
  25. Altmetric Badge
    Chapter 24 Directed cycle double covers: hexagon graphs
  26. Altmetric Badge
    Chapter 25 Finding an Odd K 3,3
  27. Altmetric Badge
    Chapter 26 Zero-error source-channel coding with entanglement
  28. Altmetric Badge
    Chapter 27 Ramsey numbers for bipartite graphs with small bandwidth
  29. Altmetric Badge
    Chapter 28 Polynomial bounds on geometric Ramsey numbers of ladder graphs
  30. Altmetric Badge
    Chapter 29 Arrangements of pseudocircles and circles
  31. Altmetric Badge
    Chapter 30 Extended abstract for structure results for multiple tilings in 3D
  32. Altmetric Badge
    Chapter 31 On the nonexistence of k -reptile simplices in ℝ 3 ana ℝ 4
  33. Altmetric Badge
    Chapter 32 Homogeneous selections from hyperplanes
  34. Altmetric Badge
    Chapter 33 Conic theta functions and their relations to theta functions
  35. Altmetric Badge
    Chapter 34 The Carathéodory number of the P 3 convexity of chordal graphs
  36. Altmetric Badge
    Chapter 35 Locally-maximal embeddings of graphs in orientable surfaces
  37. Altmetric Badge
    Chapter 36 A characterization of triangulations of closed surfaces
  38. Altmetric Badge
    Chapter 37 Quasi-perfect linear codes from singular plane cubics
  39. Altmetric Badge
    Chapter 38 Boxicity and cubicity of product graphs
  40. Altmetric Badge
    Chapter 39 Planar graphs with Δ ≥ 8 are (Δ + 1)-edge-choosable
  41. Altmetric Badge
    Chapter 40 Planar emulators conjecture is nearly true for cubic graphs
  42. Altmetric Badge
    Chapter 41 Random planar graphs with minimum degree two and three
  43. Altmetric Badge
    Chapter 42 Degenerated induced subgraphs of planar graphs
  44. Altmetric Badge
    Chapter 43 Strong chromatic index of planar graphs with large girth
  45. Altmetric Badge
    Chapter 44 On homomorphisms of planar signed graphs to signed projective cubes
  46. Altmetric Badge
    Chapter 45 Classification of k -nets embedded in a plane
  47. Altmetric Badge
    Chapter 46 An improved lower bound on the maximum number of non-crossing spanning trees
  48. Altmetric Badge
    Chapter 47 On the structure of graphs with large minimum bisection
  49. Altmetric Badge
    Chapter 48 Coloring intersection graphs of arcwise connected sets in the plane
  50. Altmetric Badge
    Chapter 49 A characterization of edge-reflection positive partition functions of vertex-coloring models
  51. Altmetric Badge
    Chapter 50 Adjacent vertex-distinguishing edge coloring of graphs
  52. Altmetric Badge
    Chapter 51 Rainbow path and minimum degree in properly edge colored graphs
  53. Altmetric Badge
    Chapter 52 B-Coloring Graphs with Girth at Least 8
  54. Altmetric Badge
    Chapter 53 The circular chromatic index of k -regular graphs
  55. Altmetric Badge
    Chapter 54 Coloring d -Embeddable k -Uniform Hypergraphs
  56. Altmetric Badge
    Chapter 55 Homomorphisms of signed bipartite graphs
  57. Altmetric Badge
    Chapter 56 A threshold for the Maker-Breaker clique game
  58. Altmetric Badge
    Chapter 57 On the threshold bias in the oriented cycle game
  59. Altmetric Badge
    Chapter 58 Building spanning trees quickly in Maker-Breaker games
  60. Altmetric Badge
    Chapter 59 Dicots, and a taxonomic ranking for misère games
  61. Altmetric Badge
    Chapter 60 Avoider-Enforcer star games
  62. Altmetric Badge
    Chapter 61 Fooling-sets and rank in nonzero characteristic
  63. Altmetric Badge
    Chapter 62 Krasner near-factorizations and 1-overlapped factorizations
  64. Altmetric Badge
    Chapter 63 Correlation inequality for formal series
  65. Altmetric Badge
    Chapter 64 Covariants of spherical Θ-orbits for types E 6 , E 7 , E 8
  66. Altmetric Badge
    Chapter 65 Partition regularity of nonlinear polynomials: a nonstandard approach
  67. Altmetric Badge
    Chapter 66 Random subgraphs make identification affordable
  68. Altmetric Badge
    Chapter 67 On two-point configurations in subsets of pseudo-random sets
  69. Altmetric Badge
    Chapter 68 On the giant component of random hyperbolic graphs
  70. Altmetric Badge
    Chapter 69 Discontinuous bootstrap percolation in power-law random graphs
  71. Altmetric Badge
    Chapter 70 On a conjecture of Graham and Häggkvist for random trees
  72. Altmetric Badge
    Chapter 71 Sharp threshold functions via a coupling method
  73. Altmetric Badge
    Chapter 72 Analytic description of the phase transition of inhomogeneous multigraphs
  74. Altmetric Badge
    Chapter 73 On the Bruhat-Chevalley order on fixed-point-free involutions
  75. Altmetric Badge
    Chapter 74 A geometric approach to combinatorial fixed-point theorems: extended abstract
  76. Altmetric Badge
    Chapter 75 Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
  77. Altmetric Badge
    Chapter 76 Proof of the 1-factorization and Hamilton decomposition conjectures
  78. Altmetric Badge
    Chapter 77 Regular hypergraphs: asymptotic counting and loose Hamilton cycles
  79. Altmetric Badge
    Chapter 78 Dynamic concentration of the triangle-free process
  80. Altmetric Badge
    Chapter 79 Subcubic triangle-free graphs have fractional chromatic number at most 14/5
  81. Altmetric Badge
    Chapter 80 Henneberg steps for triangle representations
  82. Altmetric Badge
    Chapter 81 Cycle-continuous mappings — order structure
  83. Altmetric Badge
    Chapter 82 On the structure of graphs with given odd girth and large minimum degree
  84. Altmetric Badge
    Chapter 83 On the order of cages with a given girth pair
  85. Altmetric Badge
    Chapter 84 Directed and multi-directed animals on the King’s lattice
  86. Altmetric Badge
    Chapter 85 Results and conjectures on the number of standard strong marked tableaux
  87. Altmetric Badge
    Chapter 86 On independent transversals in matroidal Latin rectangles
  88. Altmetric Badge
    Chapter 87 Multivariate Lagrange inversion formula and the cycle lemma
  89. Altmetric Badge
    Chapter 88 Simplifying inclusion — exclusion formulas
  90. Altmetric Badge
    Chapter 89 Majority and plurality problems
  91. Altmetric Badge
    Chapter 90 Combinatorial bounds on relational complexity
  92. Altmetric Badge
    Chapter 91 A combinatorial approach to colourful simplicial depth
  93. Altmetric Badge
    Chapter 92 Complexity and approximation of the smallest k -enclosing ball problem
  94. Altmetric Badge
    Chapter 93 Testing uniformity of stationary distribution
  95. Altmetric Badge
    Chapter 94 On a covering problem in the hypercube
  96. Altmetric Badge
    Chapter 95 A classification of positive posets using isotropy groups of Dynkin diagrams
  97. Altmetric Badge
    Chapter 96 Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method
  98. Altmetric Badge
    Chapter 97 Polynomial graph invariants from homomorphism numbers
  99. Altmetric Badge
    Chapter 98 An Erdős-Ko-Rado theorem for matchings in the complete graph
  100. Altmetric Badge
    Chapter 99 A constrained path decomposition of cubic graphs and the path number of cacti
  101. Altmetric Badge
    Chapter 100 On push chromatic number of planar graphs and planar p-cliques
  102. Altmetric Badge
    Chapter 101 Firefighting with general weights
  103. Altmetric Badge
    Chapter 102 Nowhere-zero flows on signed regular graphs
  104. Altmetric Badge
    Chapter 103 New transience bounds for long walks in weighted digraphs
  105. Altmetric Badge
    Chapter 104 Complexity of determining the irregular chromatic index of a graph
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
3 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
The Seventh European Conference on Combinatorics, Graph Theory and Applications
Published by
Scuola Normale Superiore, January 2014
DOI 10.1007/978-88-7642-475-5
ISBNs
978-8-87-642474-8, 978-8-87-642475-5
Editors

Nešetřil, Jaroslav, Pellegrini, Marco

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 1 33%
Student > Doctoral Student 1 33%
Unknown 1 33%
Readers by discipline Count As %
Mathematics 1 33%
Computer Science 1 33%
Unknown 1 33%