Skip to main content
SpringerLink
Log in

The Seventh European Conference on Combinatorics, Graph Theory and Applications

EuroComb 2013

  • Conference proceedings
  • © 2013

Overview

Editors:
  1. Jaroslav Nešetřil
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Marco Pellegrini
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Highlights original work and recent advances in combinatorics to be presented at the main European biennial conference in combinatorics

Part of the book series: Publications of the Scuola Normale Superiore (PSNS, volume 16)

Part of the book sub series: CRM Series (CRMSNS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 24.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 34.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (104 papers)

  1. Front Matter

    Pages i-xxvi
    Download chapter PDF

  2. Erdős problems

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. A problem of Erdős and Sós on 3-graphs

      • Roman Glebov, Daniel Král’, Jan Volec
      Pages 3-8

    3. An analogue of the Erdős-Ko-Rado theorem for multisets

      • Zoltán Füredi, Dániel Gerbner, Máté Vizer
      Pages 9-12

    4. Polynomial gap extensions of the Erdős-Pósa theorem

      • Jean-Florent Raymond, Dimitrios M. Thilikos
      Pages 13-18

    5. The Erdős-Pósa property for long circuits

      • Dirk Meierling, Dieter Rautenbach, Thomas Sasse
      Pages 19-24

  3. Hypergraphs

    1. Front Matter

      Pages 25-25
      Download chapter PDF

    2. A hypergraph Turán theorem via Lagrangians of intersecting families

      • Dan Hefetz, Peter Keevash
      Pages 27-32

    3. Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs

      • Andrew Treglown, Yi Zhao
      Pages 33-38

    4. Fractional and integer matchings in uniform hypergraphs

      • Daniela Kühn, Deryk Osthus, Timothy Townsend
      Pages 39-44

  4. Cubic graphs

    1. Front Matter

      Pages 45-45
      Download chapter PDF

    2. On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings

      • Louis Esperet, Giuseppe Mazzuoccolo
      Pages 47-51

    3. Relating ordinary and total domination in cubic graphs of large girth

      • Simone Dantas, Felix Joos, Christian Löwenstein, Dieter Rautenbach, Deiwison S. Machado
      Pages 53-57

    4. Snarks with large oddness and small number of vertices

      • Robert Lukot’ka, Edita Máčajová, Ján Mazák, Martin Škoviera
      Pages 59-64

    5. Non-trivial snarks with given circular chromatic index

      • Robert Lukot’ka, Ján Mazák
      Pages 65-70

  5. Graphs

    1. Front Matter

      Pages 71-71
      Download chapter PDF

    2. The graph formulation of the union-closed sets conjecture

      • Henning Bruhn, Pierre Charbit, Jan Arne Telle
      Pages 73-78

    3. The union-closed sets conjecture almost holds for almost all random bipartite graphs

      • Henning Bruhn, Oliver Schaudt
      Pages 79-84

    4. The robust component structure of dense regular graphs

      • Daniela Kühn, Allan Lo, Deryk Osthus, Katherine Staden
      Pages 85-90

    5. The (Δ, D) and (Δ, N) problems in double-step digraphs with unilateral diameter

      • Cristina Dalfó, Miquel Àngel Fiol
      Pages 91-96
Back to top

Keywords

About this book

In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent advances in combinatorics and graph theory including applications in other areas of mathematics, computer science and engineering. Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological combinatorics.

Bibliographic Information

  • Book Title: The Seventh European Conference on Combinatorics, Graph Theory and Applications

  • Book Subtitle: EuroComb 2013

  • Editors: Jaroslav Nešetřil, Marco Pellegrini

  • Series Title: Publications of the Scuola Normale Superiore

  • DOI: https://doi.org/10.1007/978-88-7642-475-5

  • Publisher: Edizioni della Normale Pisa

  • eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)

  • Copyright Information: Scuola Normale Superiore 2013

  • Softcover ISBN: 978-88-7642-474-8Published: 05 September 2013

  • eBook ISBN: 978-88-7642-475-5Published: 18 January 2014

  • Series ISSN: 2239-1460

  • Series E-ISSN: 2532-1668

  • Edition Number: 1

  • Topics: Combinatorics, Graph Theory

Publish with us

Policies and ethics

Back to top

Search

Navigation