LEADER 14397nam 22006855 450 001 9910438136803321 005 20251230065607.0 010 $a88-7642-475-X 024 7 $a10.1007/978-88-7642-475-5 035 $a(CKB)2550000001200046 035 $a(EBL)1698018 035 $a(OCoLC)881166068 035 $a(SSID)ssj0001187524 035 $a(PQKBManifestationID)11688480 035 $a(PQKBTitleCode)TC0001187524 035 $a(PQKBWorkID)11257521 035 $a(PQKB)10265486 035 $a(DE-He213)978-88-7642-475-5 035 $a(MiAaPQ)EBC1698018 035 $a(PPN)176127542 035 $a(EXLCZ)992550000001200046 100 $a20140118d2013 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 14$aThe Seventh European Conference on Combinatorics, Graph Theory and Applications $eEuroComb 2013 /$fedited by Jaroslav Ne?et?il, Marco Pellegrini 205 $a1st ed. 2013. 210 1$aPisa :$cScuola Normale Superiore :$cImprint: Edizioni della Normale,$d2013. 215 $a1 online resource (612 p.) 225 1 $aCRM Series,$x2532-3326 ;$v16 300 $aDescription based upon print version of record. 311 08$a88-7642-474-1 320 $aIncludes bibliographical references at the end of each chapters. 327 $tErd?s problems --$tA problem of Erd?s and Sós on 3-graphs /$rRoman Glebov, Daniel Král?, Jan Volec --$tAn analogue of the Erd?s-Ko-Rado theorem for multisets /$rZoltán Füredi, Dániel Gerbner, Máté Vizer --$tPolynomial gap extensions of the Erd?s-Pósa theorem /$rJean-Florent Raymond, Dimitrios M. Thilikos --$tThe Erd?s-Pósa property for long circuits /$rDirk Meierling, Dieter Rautenbach, Thomas Sasse --$tHypergraphs --$tA hypergraph Turán theorem via Lagrangians of intersecting families /$rDan Hefetz, Peter Keevash --$tTight minimum degree conditions forcing perfect matchings in uniform hypergraphs /$rAndrew Treglown, Yi Zhao --$tFractional and integer matchings in uniform hypergraphs /$rDaniela Kühn, Deryk Osthus, Timothy Townsend --$tCubic graphs --$tOn cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings /$rLouis Esperet, Giuseppe Mazzuoccolo --$tRelating ordinary and total domination in cubic graphs of large girth /$rSimone Dantas, Felix Joos, Christian Löwenstein, Dieter Rautenbach, Deiwison S. Machado --$tSnarks with large oddness and small number of vertices /$rRobert Lukot?ka, Edita Má?ajová, Ján Mazák, Martin ?koviera --$tNon-trivial snarks with given circular chromatic index /$rRobert Lukot?ka, Ján Mazák --$tGraphs --$tThe graph formulation of the union-closed sets conjecture /$rHenning Bruhn, Pierre Charbit, Jan Arne Telle --$tThe union-closed sets conjecture almost holds for almost all random bipartite graphs /$rHenning Bruhn, Oliver Schaudt --$tThe robust component structure of dense regular graphs /$rDaniela Kühn, Allan Lo, Deryk Osthus, Katherine Staden --$tThe (?, D) and (?, N) problems in double-step digraphs with unilateral diameter /$rCristina Dalfó, Miquel Ŕngel Fiol --$tCritical groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields /$rSwee Hong Chan, Henk D. L. Hollmann, Dmitrii V. Pasechnik --$tTwo notions of unit distance graphs /$rNoga Alon, Andrey Kupavskii --$tAn interlacing approach for bounding the sum of Laplacian eigenvalues of graphs /$rAida Abiad, Miquel A. Fiol, Willem H. Haemers, Guillem Perarnau --$tOn the structure of the group of balanced labelings on graphs /$rYonah Cherniavsky, Avraham Goldstein, Vadim E. Levit --$tThe price of connectivity for feedback vertex set /$rRémy Belmonte, Pim van?t Hof, Marcin Kami?ski, Daniël Paulusma --$tA local flow algorithm in bounded degree networks /$rEndre Csóka --$tThe maximum time of 2-neighbour bootstrap percolation: algorithmic aspects /$rFabrício Benevides, Victor Campos, Mitre C. Dourado, Rudini M. Sampaio, Ana Silva --$tA multipartite Hajnal-Szemerédi theorem /$rPeter Keevash, Richard Mycroft --$tDirected cycle double covers: hexagon graphs /$rAndrea Jiménez, Mihyun Kang, Martin Loebl --$tFinding an Odd K 3,3 /$rPeter Whalen, Robin Thomas --$tZero-error source-channel coding with entanglement /$rJop Briët, Harry Buhrman, Monique Laurent, Teresa Piovesan, Giannicola Scarpa -- 327 $tRamsey Theory --$tRamsey numbers for bipartite graphs with small bandwidth /$rGuilherme O. Mota, Gábor N. Sárk?zy, Mathias Schacht, Anusch Taraz --$tPolynomial bounds on geometric Ramsey numbers of ladder graphs /$rJosef Cibulka, Pu Gao, Marek Kr?ál, Tomá? Valla, Pavel Valtr --$tGeometry and Surfaces --$tArrangements of pseudocircles and circles /$rRoss J. Kang, Tobias Müller --$tExtended abstract for structure results for multiple tilings in 3D /$rNick Gravin, Mihail N. Kolountzakis, Sinai Robins, Dmitry Shiryaev --$tOn the nonexistence of k-reptile simplices in 3 ana 4 /$rJan Kyn?l, Zuzana Safernová /$r--$tHomogeneous selections from hyperplanes /$rImre Bárány, János Pach --$tConic theta functions and their relations to theta functions /$rAmanda Folsom, Winfried Kohnen, Sinai Robins --$tThe Carathéodory number of the P 3 convexity of chordal graphs /$rErika M. M. Coelho, Mitre C. Dourado, Dieter Rautenbach, Jayme L. Szwarcfiter --$tLocally-maximal embeddings of graphs in orientable surfaces /$rMichal Kotrb?ík, Martin ?koviera --$tA characterization of triangulations of closed surfaces /$rJorge Arocha, Javier Bracho, Natalia García-Colín, Isabel Hubard --$tQuasi-perfect linear codes from singular plane cubics /$rMassimo Giulietti --$tBoxicity and cubicity of product graphs /$rL. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad --$tPlanarity --$tPlanar graphs with ? ? 8 are (? + 1)-edge-choosable /$rMarthe Bonamy --$tPlanar emulators conjecture is nearly true for cubic graphs /$rMartin Derka, Petr Hlin?ný --$tRandom planar graphs with minimum degree two and three /$rMarc Noy, Lander Ramos --$tDegenerated induced subgraphs of planar graphs /$rRobert Lukot?ka, Ján Mazák, Xuding Zhu --$tStrong chromatic index of planar graphs with large girth /$rMickaël Montassier, Arnaud Pęcher, André Raspaud --$tOn homomorphisms of planar signed graphs to signed projective cubes /$rReza Naserasr, Edita Rollová, Éric Sopena --$tClassification of k-nets embedded in a plane /$rGábor Korchmáros --$tAn improved lower bound on the maximum number of non-crossing spanning trees /$rClemens Huemer, Anna de Mier --$tOn the structure of graphs with large minimum bisection /$rCristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz --$tColorings --$tColoring intersection graphs of arcwise connected sets in the plane /$rMicha? Laso?, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak --$tA characterization of edge-reflection positive partition functions of vertex-coloring models /$rGuus Regts --$tAdjacent vertex-distinguishing edge coloring of graphs /$rMarthe Bonamy, Nicolas Bousquet, Hervé Hocquard --$tRainbow path and minimum degree in properly edge colored graphs /$rAnita Das, P. Suresh, S. V. Subrahmanya --$tB-Coloring Graphs with Girth at Least 8 /$rVictor Campos, Carlos Lima, Ana Silva --$tThe circular chromatic index of k-regular graphs /$rBarbora Candráková, Edita Má?ajová --$tColoring d-Embeddable k-Uniform Hypergraphs /$rCarl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko, Anusch Taraz --$tHomomorphisms of signed bipartite graphs /$rReza Naserasr, Edita Rollovâ, Éric Sopena -- 327 $tGames --$tA threshold for the Maker-Breaker clique game /$rTobias Müller, Milo? Stojakovi? --$tOn the threshold bias in the oriented cycle game /$rDennis Clemens, Anita Liebenau --$tBuilding spanning trees quickly in Maker-Breaker games /$rDennis Clemens, Asaf Ferber, Roman Glebov, Dan Hefetz, Anita Liebenau --$tDicots, and a taxonomic ranking for misčre games /$rPaul Dorbec, Gabriel Renault, Aaron Siegel, Éric Sopena --$tAvoider-Enforcer star games /$rAndrzej Grzesik, Mirjana Mikala?ki, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman --$tAlgebra and Polynomials --$tFooling-sets and rank in nonzero characteristic /$rMirjam Friesen, Dirk Oliver Theis --$tKrasner near-factorizations and 1-overlapped factorizations /$rTadashi Sakuma, Hidehiro Shinohara --$tCorrelation inequality for formal series /$rVladimir Blinovsky --$tCovariants of spherical ?-orbits for types E 6, E 7, E 8 /$rWitold Kra?kiewicz, Jerzy Weyman --$tPartition regularity of nonlinear polynomials: a nonstandard approach /$rLorenzo Luperi Baglini --$tRandomness --$tRandom subgraphs make identification affordable /$rFlorent Foucaud, Guillem Perarnau, Oriol Serra --$tOn two-point configurations in subsets of pseudo-random sets /$rElad Aigner-Horev, Hi?p Hŕn --$tOn the giant component of random hyperbolic graphs /$rMichel Bode, Nikolaos Fountoulakis, Tobias Müller --$tDiscontinuous bootstrap percolation in power-law random graphs /$rHamed Amini, Nikolaos Fountoulakis, Konstantinos Panagiotou --$tOn a conjecture of Graham and Häggkvist for random trees /$rMichael Drmota, Anna Lladó --$tSharp threshold functions via a coupling method /$rKatarzyna Rybarczyk --$tAnalytic description of the phase transition of inhomogeneous multigraphs /$rÉlie de Panafieu, Vlady Ravelomanana --$tFixed-point --$tOn the Bruhat-Chevalley order on fixed-point-free involutions /$rMahir Bilen Can, Yonah Cherniavsky, Tim Twelbeck --$tA geometric approach to combinatorial fixed-point theorems: extended abstract /$rElyot Grant, Will Ma --$tHamiltonicity --$tProof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments /$rDaniela Kühn, John Lapinskas, Deryk Osthus, Viresh Patel --$tProof of the 1-factorization and Hamilton decomposition conjectures /$rBéla Csaba, Daniela Kühn, Allan Lo, Deryk Osthus, Andrew Treglown --$tRegular hypergraphs: asymptotic counting and loose Hamilton cycles /$rAndrzej Dudek, Alan Frieze, Andrzej Ruci?ski, Matas ?ileikis -- 327 $tTriangles --$tDynamic concentration of the triangle-free process /$rTom Bohman, Peter Keevash --$tSubcubic triangle-free graphs have fractional chromatic number at most 14/5 /$rZden?k Dvo?ák, Jean-Sébastien Sereni, Jan Volec --$tHenneberg steps for triangle representations /$rNieke Aerts, Stefan Felsner --$tCycles and Girth of Graphs --$tCycle-continuous mappings --$torder structure /$rRobert ?ámal --$tOn the structure of graphs with given odd girth and large minimum degree /$rSilvia Messuti, Mathias Schacht --$tOn the order of cages with a given girth pair /$rJulian Salas, Camino Balbuena --$tEnumerations, Lattices and Tableaux --$tEnumerations, Lattices and Tableaux /$r--$tDirected and multi-directed animals on the King?s lattice /$rAxel Bacher --$tResults and conjectures on the number of standard strong marked tableaux /$rSusanna Fishel, Matja? Konvalinka --$tOn independent transversals in matroidal Latin rectangles /$rRon Aharoni, Daniel Kotlar, Ran Ziv --$tMultivariate Lagrange inversion formula and the cycle lemma /$rAxel Bacher, Gilles Schaeffer --$tCombinatorics and algorithms --$tSimplifying inclusion, exclusion formulas /$rXavier Goaoc, Ji?í Matou?ek, Pavel Paták, Zuzana Safernová, Martin Tancer --$tMajority and plurality problems /$rDániel Gerbner, Gyula O. H. Katona, Dömötör Pĺlvölgyi, Balázs Patkós --$tCombinatorial bounds on relational complexity /$rDavid Hartman, Jan Hubi?ka, Jaroslav Ne?et?il --$tA combinatorial approach to colourful simplicial depth /$rAntoine Deza, Frédéric Meunier, Pauline Sarrabezolles --$tComplexity and approximation of the smallest k-enclosing ball problem /$rVladimir Shenmaier --$tTesting uniformity of stationary distribution /$rSourav Chakraborty, Akshay Kamath, Rameshwar Pratap --$tOn a covering problem in the hypercube /$rLale Özkahya, Brendon Stanton --$tA classification of positive posets using isotropy groups of Dynkin diagrams /$rMarcin Ga?siorek, Daniel Simson -- 327 $tPosters --$tEnumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method /$rRaúl M. Falcón --$tPolynomial graph invariants from homomorphism numbers /$rDelia Garijo, Andrew J. Goodall, Jaroslav Ne?et?il --$tAn Erd?s-Ko-Rado theorem for matchings in the complete graph /$rVikram Kamat, Neeldhara Misra --$tA constrained path decomposition of cubic graphs and the path number of cacti /$rFábio Botler, Yoshiko Wakabayashi --$tOn push chromatic number of planar graphs and planar p-cliques /$rSagnik Sen --$tFirefighting with general weights /$rVitor Costa, Simone Dantas, Mitre C. Dourado, Lucia D. Penso, Dieter Rautenbach --$tNowhere-zero flows on signed regular graphs /$rEckhard Steffen, Michael Schubert --$tNew transience bounds for long walks in weighted digraphs /$rBernadette Charron-Bost, Matthias Függer, Thomas Nowak --$tComplexity of determining the irregular chromatic index of a graph /$rJulien Bensmail --$tIndex. 330 $aIn 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. 410 0$aCRM Series,$x2532-3326 ;$v16 606 $aDiscrete mathematics 606 $aGraph theory 606 $aDiscrete Mathematics 606 $aGraph Theory 615 0$aDiscrete mathematics. 615 0$aGraph theory. 615 14$aDiscrete Mathematics. 615 24$aGraph Theory. 676 $a511.5 676 $a511.6 702 $aNes?etr?il$b Jaroslav$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPellegrini$b Marco$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 2$bNZ-WeVUL 906 $aBOOK 912 $a9910438136803321 996 $aThe Seventh European Conference on Combinatorics, Graph Theory and Applications$92529618 997 $aUNINA