Login:    Password:   

Eurocomb 2013 Accepted Contributions

The list of accepted contributions is given below.

  • Imre Barany and Janos Pach. Homogeneous selections from hyperplanes
  • Rameshwar Pratap, Sourav Chakraborty and Akshay D Kamath. Testing Uniformity of Stationary Distribution
  • Giuseppe Mazzuoccolo and Louis Esperet. On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
  • Vladimir Blinovsky. Correlation Inequality for Formal Series
  • Dieter Rautenbach, Dirk Meierling and Thomas Sasse. The Erdos-Posa Property for Long Circuits
  • Oliver Schaudt and Henning Bruhn. The union-closed sets conjecture almost holds for almost all random bipartite graphs
  • Andrea Jiménez, Mihyun Kang and Martin Loebl. Directed Cycle Double Covers: Hexagon Graphs
  • Lale Ozkahya and Brendon Stanton. On a covering problem in the hypercube
  • Daniel Gerbner, Gyula O.H. Katona, Domotor Palvolgyi and Balazs Patkos. Majority and Plurality Problems
  • Montassier Mickaël, Arnaud Pêcher and Raspaud André. Strong chromatic index of planar graphs with large girth
  • Ron Aharoni, Daniel Kotlar and Ran Ziv. On independent transversals in matroidal Latin squares
  • Béla Csaba, Daniela Kühn, Allan Lo, Deryk Osthus and Andrew Treglown. Proof of the $1$-factorization and Hamilton decomposition conjectures
  • Andrew Treglown and Yi Zhao. Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
  • Jean-Florent Raymond and Dimitrios Thilikos. Polynomial Gap Extensions of the Erdos-Posa Theorem
  • Robert Lukotka and Ján Mazák. Non-trivial snarks with given circular chromatic index
  • Robert Lukotka, Ján Mazák and Xuding Zhu. Degenerated induced subgraphs of planar graphs
  • Daniela Kühn, John Lapinskas, Deryk Osthus and Viresh Patel. Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
  • Roman Glebov, Jan Volec and Daniel Král'. A problem of Erdos and Sos on 3-graphs
  • Anita Das, Suresh P and Subrahmanya S. V.. Rainbow path and minimum degree in properly edge colored graphs
  • Henning Bruhn, Pierre Charbit and Jan Arne Telle. The graph formulation of the union-closed sets conjecture
  • Nieke Aerts and Stefan Felsner. Henneberg Steps for Triangle Representations
  • Guus Regts. A characterization of edge reflection positive partition functions of vertex coloring models
  • Susanna Fishel and Matjaz Konvalinka. Results and conjectures on the number of standard strong marked tableaux
  • Katarzyna Rybarczyk. Sharp threshold functions via a coupling method
  • Tobias Muller and Milos Stojakovic. A threshold for the Maker-Breaker clique game
  • Lorenzo Luperi Baglini. Partition Regularity of Nonlinear Polynomials: a Nonstandard Approach
  • Ross J. Kang and Tobias Mueller. Arrangements of pseudocircles and circles
  • Andrzej Grzesik, Mirjana Mikalacki, Zoltan Lorant Nagy, Alon Naor, Balazs Patkos and Fiona Skerman. Avoider-Enforcer star games
  • Erika Coelho, Mitre Dourado, Dieter Rautenbach and Jayme Szwarcfiter. The Carath'{e}odory Number of the $P_3$ Convexity of Chordal Graphs
  • L. Sunil Chandran, Wilfried Imrich, Rogers Mathew and Deepak Rajendraprasad. Boxicity and Cubicity of Product Graphs
  • Noga Alon and Andrey Kupavskii. Two notions of unit distance graphs
  • Cristina Dalfó and Miguel Angel Fiol. The (Delta,D) and (Delta,N) Problems in Double-Step Digraphs with Unilateral Diameter
  • Silvia Messuti and Mathias Schacht. On the structure of graphs with given odd girth and large minimum degree
  • Reza Naserasr, Edita Rollova and Eric Sopena. Homomorphisms of signed bipartite graphs
  • Yonah Cherniavsky, Avraham Goldstein and Vadim Levit. On the Structure of the Group of Balanced Labelings on Graphs: Extended abstract
  • Peter Keevash and Richard Mycroft. A multipartite Hajnal-Szemerédi theorem
  • Marthe Bonamy. Planar graphs with Delta>=8 are (Delta+1)-edge-choosable.
  • Barbora Candráková and Edita MáÂÂ┬Źcajová. The circular chromatic index of k -Regular graphs
  • Michel Bode, Nikolaos Fountoulakis and Tobias Mueller. On the giant component of random hyperbolic graphs
  • Sinai Robins, Amanda Folsom and Winfried Kohnen. Conic theta functions and what they tell us about integer polyhedral cones
  • Dan Hefetz and Peter Keevash. A hypergraph Tur'an theorem via lagrangians of intersecting families
  • Martin Derka and Petr Hlineny. Planar Emulators Conjecture Is Nearly True for Cubic Graphs
  • Daniela Kühn, Deryk Osthus and Timothy Townsend. Fractional and integer matchings in uniform hypergraphs
  • Nick Gravin, Mihail Kolountzakis, Sinai Robins and Dmitry Shiryaev. EXTENDED ABSTRACT FOR STRUCTURE RESULTS FOR MULTIPLE TILINGS IN 3D
  • Xavier Goaoc, Jiri Matousek, Pavel Patak, Zuzana Safernova and Martin Tancer. Simplifying inclusion - exclusion formulas
  • Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko and Anusch Taraz. Coloring d-Embeddable k-Uniform Hypergraphs
  • Abiad Aida, Miguel Angel Fiol, Willem H. Haemers and Guillem Perarnau. An Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs
  • Hamed Amini, Nikolaos Fountoulakis and Konstantinos Panagiotou. Discontinuous bootstrap percolation in power-law random graphs
  • Witold Kraskiewicz and Jerzy Weyman. Covariants of spherical $Theta$-orbits for types $E_6$, $E_7$, $E_8$
  • Tom Bohman and Peter Keevash. Dynamic concentration of the triangle-free process
  • Gabor Korchmaros. Classification of k-nets embedded in a plane
  • Simone Dantas, Felix Joos, Christian Loewenstein, Dieter Rautenbach and Deiwison Sousa. Relating Ordinary and Total Domination in Cubic Graphs of Large Girth
  • Guilherme Mota, Gábor N. Sárközy, Mathias Schacht and Anusch Taraz. Ramsey numbers for bipartite graphs with small bandwidth
  • Clemens Huemer and Anna de Mier. An improved lower bound on the maximum number of non-crossing spanning trees
  • Massimo Giulietti. Quasi-perfect linear codes from singular plane cubics
  • Zdenek Dvorák, Jean-Sébastien Sereni and Jan Volec. Subcubic triangle-free graphs have fractional chromatic number at most 14/5
  • Vitor Costa, Simone Dantas, Mitre Dourado, Lucia Penso and Dieter Rautenbach. Firefighting with General Weights
  • Cristina Fernandes, Tina Janne Schmidt and Anusch Taraz. On the Structure of Graphs with Large Minimum Bisection
  • Vladimir Shenmaier. Complexity and Approximation of the Smallest k-Enclosing Ball Problem
  • Mahir Bilen Can, Yonah Cherniavsky and Tim Twelbeck. Bruhat-Chevalley order on fixed-point-free involutions: Extended Abstract
  • Natalia García-Colín, Jorge Arocha, Javier Bracho and Isabel Hubard. A characterization of triangulations of closed surfaces
  • Victor Campos, Carlos Lima and Ana Silva. b-coloring graphs with girth at least 8
  • Anita Liebenau and Dennis Clemens. On the threshold bias in the oriented cycle game
  • Michael Drmota and Anna Llado. On a conjecture of Graham and H"aggkvist for random trees
  • Eckhard Steffen and Michael Schubert. Nowhere-zero flows on signed cubic graphs
  • Florent Foucaud, Guillem Perarnau and Oriol Serra. Random subgraphs make identification affordable
  • Dennis Clemens, Dan Hefetz, Asaf Ferber, Roman Glebov and Anita Liebenau. Building spanning trees quickly in Maker-Breaker games
  • Daniela Kühn, Allan Lo, Deryk Osthus and Katherine Staden. The robust component structure of dense regular graphs
  • Tomáš Valla, Josef Cibulka, Marek Král, Pu Gao and Pavel Valtr. Polynomial Bounds on Geometric Ramsey Numbers of Ladder Graphs
  • Antoine Deza, Frédéric Meunier and Pauline Sarrabezolles. A combinatorial approach to colourful simplicial depth
  • Robert Lukotka, Edita Macajova, Ján Mazák and Martin Skoviera. Snarks with large oddness and small number of vertices
  • Marcin GÄ…siorek and Daniel Simson. A Classification of Positive Posets Using Isotropy Groups of Dynkin Diagrams
  • Zoltán Füredi, Dániel Gerbner and Mate Vizer. An analogue of the Erdos-Ko-Rado theorem for multisets
  • Julien Bensmail. Complexity of determining the irregular chromatic index of a graph
  • Rémy Belmonte, Pim van 'T Hof, Marcin Kaminski and Daniel Paulusma. The Price of Connectivity for Feedback Vertex Set
  • Paul Dorbec, Gabriel Renault, Aaron Siegel and Éric Sopena. Dicots, and a taxonomic ranking for misère games
  • Jan Kyncl and Zuzana Safernova. On the nonexistence of k-reptile simplices in R^3 and R^4
  • Swee Hong Chan, Henk Hollmann and Dmitrii Pasechnik. Critical groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
  • Fabricio S. Benevides, Victor Campos, Mitre Dourado, Rudini Sampaio and Ana Silva. The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
  • Marc Noy and Lander Ramos. Random planar graphs with minimum degree two and three
  • Bernadette Charron-Bost, Matthias Függer and Thomas Nowak. New Transience Bounds for Long Walks in Weighted Digraphs
  • Hervé Hocquard, Marthe Bonamy and Nicolas Bousquet. Adjacent vertex-distinguishing edge coloring of graphs
  • David Hartman, Jan Hubicka and Jaroslav Nesetril. Combinatorial Bounds on Relational Complexity
  • Dirk Oliver Theis and Mirjam Friesen. Fooling-sets and rank in nonzero characteristic
  • Michal Kotrbcik and Martin Skoviera. Locally-Maximal Embeddings of Graphs in Orientable Surfaces
  • Jop Briet, Harry Buhrman, Monique Laurent, Teresa Piovesan and Giannicola Scarpa. Zero-error source-channel coding with entanglement
  • Reza Naserasr, Edita Rollova and Éric Sopena. On homomorphisms of planar signed graphs to signed projective cubes
  • Delia Garijo, Andrew Goodall and Jaroslav Nesetril. Polynomial graph invariants from homomorphism numbers
  • Vikram Kamat and Neeldhara Misra. An Erdos--Ko--Rado theorem for matchings in the complete graph
  • Robert Samal. Cycle-continuous mappings -- order structure
  • Andrzej Dudek, Alan Frieze, Andrzej RuciÅ„ski and Matas Šileikis. Regular Hypergraphs: Asymptotic Counting and Loose Hamilton Cycles
  • Axel Bacher and Gilles Schaeffer. Multivariate Lagrange inversion formula and the cycle lemma
  • Elyot Grant and Will Ma. A Geometric Approach to Combinatorial Fixed-Point Theorems
  • Julián Salas and Camino Balbuena. On the order of cages with a given girth pair
  • Elie De Panafieu and Ravelomanana Vlady. Analytic description of the phase transition of inhonomogeneous multigraphs
  • Fábio Botler and Yoshiko Wakabayashi. A constrained path decomposition of cubic graphs and the path number of cacti
  • Paul Dorbec, Ingo Schiermeyer, Elzbieta Sidorowicz and Eric Sopena. Rainbow connection in oriented graphs
  • Tadashi Sakuma and Hidehiro Shinohara. Krasner near factorizations and 1-overlapped factorizations
  • Michal‚ Lasori„, Piotr Micek, Arkadiusz Pawlik and Bartosz Walczak. Coloring intersection graphs of arcwise connected sets in the plane
  • Raúl Falcón. Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method.
  • Axel Bacher. Directed and multi-directed animals on the King's lattice
  • Peter Whalen and Robin Thomas. Finding an Odd K3,3
  • Elad Aigner-Horev and Hiep Han. On two-point configurations in subsets of pseudo-random sets
  • Sagnik Sen. On push chromatic number of planar graphs and planar p-cliques
  • Endre Csoka. A local flow algorithm in bounded degree networks
  • Agelos Georgakopoulos. Square Tilings and the Poisson Boundary