The seventh European Conference on Combinatorics, Graph Theory and Applications EuroComb 2013 edited by Jaroslav Nešetřil, Marco Pellegrini

Format:

Book

Conference/Event

Contributor:

Nešetřil, Jaroslav, editor.

Pellegrini, Marco, editor.

Conference Name:

European Conference on Combinatorics, Graph Theory and Applications (7th : 2013 : Pisa, Italy)

Series:

CRM series (Pisa, Italy) 16

CRM Series 16

Language:

English

Subjects (All):

Combinatorial analysis--Congresses.

Combinatorial analysis.

Graph theory--Congresses.

Graph theory.

Mathematics.

Combinatorics.

Graph Theory.

Medical Subjects:

Mathematics.

Local Subjects:

Mathematics.

Combinatorics.

Graph Theory.

Genre:

proceedings (reports)

Conference papers and proceedings

Physical Description:

1 online resource

Other Title:

EuroComb 2013

Place of Publication:

Pisa Scuola Normale Superiore 2013

System Details:

PDF

text file

Summary:

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

Contents:

Erdős problems A problem of Erdős and Sós on 3-graphs Roman Glebov, Daniel Král', Jan Volec An analogue of the Erdős-Ko-Rado theorem for multisets Zoltán Füredi, Dániel Gerbner, Máté Vizer Polynomial gap extensions of the Erdős-Pósa theorem Jean-Florent Raymond, Dimitrios M. Thilikos The Erdős-Pósa property for long circuits Dirk Meierling, Dieter Rautenbach, Thomas Sasse Hypergraphs A hypergraph Turán theorem via Lagrangians of intersecting families Dan Hefetz, Peter Keevash Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs Andrew Treglown, Yi Zhao Fractional and integer matchings in uniform hypergraphs Daniela Kühn, Deryk Osthus, Timothy Townsend Cubic graphs On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings Louis Esperet, Giuseppe Mazzuoccolo Relating ordinary and total domination in cubic graphs of large girth Simone Dantas [and others] Snarks with large oddness and small number of vertices Robert Lukot'ka [and others] Non-trivial snarks with given circular chromatic index Robert Lukot'ka, Ján Mazák

Directed cycle double covers: hexagon graphs Andrea Jiménez, Mihyun Kang, Martin Loebl Finding an Odd K 3,3 Peter Whalen, Robin Thomas Zero-error source-channel coding with entanglement Jop Briët [and others] Ramsey Theory Ramsey numbers for bipartite graphs with small bandwidth Guilherme O. Mota [and others] Polynomial bounds on geometric Ramsey numbers of ladder graphs Josef Cibulka [and others] Geometry and Surfaces Arrangements of pseudocircles and circles Ross J. Kang, Tobias Müller Extended abstract for structure results for multiple tilings in 3D Nick Gravin [and others] On the nonexistence of k-reptile simplices in R3 ana R4 Jan Kynčl, Zuzana Safernová Homogeneous selections from hyperplanes Imre Bárány, János Pach Conic theta functions and their relations to theta functions Amanda Folsom, Winfried Kohnen, Sinai Robins The Carathéodory number of the P 3 convexity of chordal graphs Erika M.M. Coelho [and others] Locally-maximal embeddings of graphs in orientable surfaces Michal Kotrbčík, Martin Škoviera A characterization of triangulations of closed surfaces Jorge Arocha [and others]

Graphs The graph formulation of the union-closed sets conjecture Henning Bruhn, Pierre Charbit, Jan Arne Telle The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn, Oliver Schaudt The robust component structure of dense regular graphs Daniela Kühn [and others] The (Δ, D) and (Δ, N) problems in double-step digraphs with unilateral diameter Cristina Dalfó, Miquel Àngel Fiol Critical groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields Swee Hong Chan, Henk D.L. Hollmann, Dmitrii V. Pasechnik Two notions of unit distance graphs Noga Alon, Andrey Kupavskii An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs Aida Abiad [and others] On the structure of the group of balanced labelings on graphs Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit The price of connectivity for feedback vertex set Rémy Belmonte [and others] A local flow algorithm in bounded degree networks Endre Csóka The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects Fabrício Benevides [and others] A multipartite Hajnal-Szemerédi theorem Peter Keevash, Richard Mycroft

Adjacent vertex-distinguishing edge coloring of graphs Marthe Bonamy, Nicolas Bousquet, Hervé Hocquard Rainbow path and minimum degree in properly edge colored graphs Anita Das, P. Suresh, S.V. Subrahmanya

B-Coloring Graphs with Girth at Least 8 Victor Campos, Carlos Lima, Ana Silva The circular chromatic index of k-regular graphs Barbora Candráková, Edita Máčajová Coloring d-Embeddable k-Uniform Hypergraphs Carl Georg Heise [and others] Homomorphisms of signed bipartite graphs Reza Naserasr, Edita Rollovâ, Éric Sopena Games A threshold for the Maker-Breaker clique game Tobias Müller, Miloš Stojaković On the threshold bias in the oriented cycle game Dennis Clemens, Anita Liebenau Building spanning trees quickly in Maker-Breaker games Dennis Clemens [and others] Dicots, and a taxonomic ranking for misère games Paul Dorbec [and others] Avoider-Enforcer star games Andrzej Grzesik, Mirjana Mikalački [and others] Algebra and Polynomials Fooling-sets and rank in nonzero characteristic Mirjam Friesen, Dirk Oliver Theis Krasner near-factorizations and 1-overlapped factorizations Tadashi Sakuma, Hidehiro Shinohara

Quasi-perfect linear codes from singular plane cubics Massimo Giulietti Boxicity and cubicity of product graphs L. Sunil Chandran [and others] Planarity Planar graphs with Δ ≥ 8 are (Δ + 1)-edge-choosable Marthe Bonamy Planar emulators conjecture is nearly true for cubic graphs Martin Derka, Petr Hliněný Random planar graphs with minimum degree two and three Marc Noy, Lander Ramos Degenerated induced subgraphs of planar graphs Robert Lukot'ka, Ján Mazák, Xuding Zhu Strong chromatic index of planar graphs with large girth Mickaël Montassier, Arnaud Pêcher, André Raspaud On homomorphisms of planar signed graphs to signed projective cubes Reza Naserasr, Edita Rollová, Éric Sopena Classification of k-nets embedded in a plane Gábor Korchmáros An improved lower bound on the maximum number of non-crossing spanning trees Clemens Huemer, Anna de Mier On the structure of graphs with large minimum bisection Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz Colorings Coloring intersection graphs of arcwise connected sets in the plane Michał Lasoń [and others] A characterization of edge-reflection positive partition functions of vertex-coloring models Guus Regts

Hamiltonicity Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments Daniela Kühn, John Lapinskas, Deryk Osthus, Viresh Patel Proof of the 1-factorization and Hamilton decomposition conjectures Béla Csaba [and others] Regular hypergraphs: asymptotic counting and loose Hamilton cycles Andrzej Dudek [and others] Triangles Dynamic concentration of the triangle-free process Tom Bohman, Peter Keevash Subcubic triangle-free graphs have fractional chromatic number at most 14/5 Zdeněk Dvořák, Jean-Sébastien Sereni, Jan Volec Henneberg steps for triangle representations Nieke Aerts, Stefan Felsner Cycles and Girth of Graphs Cycle-continuous mappings

order structure Robert Šámal On the structure of graphs with given odd girth and large minimum degree Silvia Messuti, Mathias Schacht On the order of cages with a given girth pair Julian Salas, Camino Balbuena Enumerations, Lattices and Tableaux Directed and multi-directed animals on the King's lattice Axel Bacher Results and conjectures on the number of standard strong marked tableaux Susanna Fishel, Matjaž Konvalinka

Correlation inequality for formal series Vladimir Blinovsky Covariants of spherical Θ-orbits for types E 6, E 7, E 8 Witold Kraśkiewicz, Jerzy Weyman Partition regularity of nonlinear polynomials: a nonstandard approach Lorenzo Luperi Baglini Randomness Random subgraphs make identification affordable Florent Foucaud, Guillem Perarnau, Oriol Serra On two-point configurations in subsets of pseudo-random sets Elad Aigner-Horev, Hiệp Hàn On the giant component of random hyperbolic graphs Michel Bode, Nikolaos Fountoulakis, Tobias Müller Discontinuous bootstrap percolation in power-law random graphs Hamed Amini, Nikolaos Fountoulakis, Konstantinos Panagiotou On a conjecture of Graham and Häggkvist for random trees Michael Drmota, Anna Lladó Sharp threshold functions via a coupling method Katarzyna Rybarczyk Analytic description of the phase transition of inhomogeneous multigraphs Élie de Panafieu, Vlady Ravelomanana Fixed-point On the Bruhat-Chevalley order on fixed-point-free involutions Mahir Bilen Can, Yonah Cherniavsky, Tim Twelbeck A geometric approach to combinatorial fixed-point theorems: extended abstract Elyot Grant, Will Ma

On independent transversals in matroidal Latin rectangles Ron Aharoni, Daniel Kotlar, Ran Ziv Multivariate Lagrange inversion formula and the cycle lemma Axel Bacher, Gilles Schaeffer Combinatorics and algorithms Simplifying inclusion

exclusion formulas Xavier Goaoc [and others] Majority and plurality problems Dániel Gerbner [and others] Combinatorial bounds on relational complexity David Hartman, Jan Hubička, Jaroslav Nešetřil A combinatorial approach to colourful simplicial depth Antoine Deza, Frédéric Meunier, Pauline Sarrabezolles Complexity and approximation of the smallest k-enclosing ball problem Vladimir Shenmaier Testing uniformity of stationary distribution Sourav Chakraborty, Akshay Kamath, Rameshwar Pratap On a covering problem in the hypercube Lale Özkahya, Brendon Stanton A classification of positive posets using isotropy groups of Dynkin diagrams Marcin Ga̧siorek, Daniel Simson

Posters Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method Raúl M. Falcón Polynomial graph invariants from homomorphism numbers Delia Garijo, Andrew J. Goodall, Jaroslav Nešetřil An Erdős-Ko-Rado theorem for matchings in the complete graph Vikram Kamat, Neeldhara Misra A constrained path decomposition of cubic graphs and the path number of cacti Fábio Botler, Yoshiko Wakabayashi On push chromatic number of planar graphs and planar p-cliques Sagnik Sen Firefighting with general weights Vitor Costa [and others] Nowhere-zero flows on signed regular graphs Eckhard Steffen, Michael Schubert New transience bounds for long walks in weighted digraphs Bernadette Charron-Bost, Matthias Függer, Thomas Nowak Complexity of determining the irregular chromatic index of a graph Julien Bensmail

Notes:

Includes bibliographical references

Online resource; title from PDF title page (SpringerLink, viewed January 20, 2014)

Other Format:

Printed edition:

ISBN:

9788876424755

887642475X

8876424741

9788876424748

OCLC:

870683873

Access Restriction:

Restricted for use by site license