LEADER 05892nam 22006735 450 001 9910438136803321 005 20200701090943.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,$x2239-4524 ;$v16 300 $aDescription based upon print version of record. 311 $a88-7642-474-1 320 $aIncludes bibliographical references at the end of each chapters. 327 $a""Cover""; ""Title Page""; ""Copyright Page""; ""Table of Contents""; ""Foreword""; ""Invited Speakers""; ""ErdA??s problems""; ""A problem of ErdA??s and SA?³s on 3-graphs""; ""1 Introduction""; ""2 Sketch of the proof""; ""References""; ""An analogue of the ErdA??s-Ko-Rado theorem for multisets""; ""1 Introduction""; ""1.1 Definitions, notation""; ""1.2 History""; ""1.3 Conjectures""; ""1.4 Results""; ""2 Concluding remarks""; ""References""; ""Polynomial gap extensions of the ErdA??sa???PA?³sa theorem""; ""1 Introduction""; ""2 Excluding packings of planar graphs""; ""References"" 327 $a""The ErdA??s-PA?³sa property for long circuits""""1 Introduction""; ""2 Proof of Theorem 1.1""; ""References""; ""Hypergraphs""; ""A hypergraph TurA?¡n theorem via Lagrangians of intersecting families""; ""1 Introduction""; ""2 Lagrangians of intersecting 3-graphs""; ""3 An application to a hypergraph TurA?¡n problem""; ""3.1 Stability""; ""4 Concluding remarks and open problems""; ""References""; ""Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs""; ""1 Introduction""; ""2 Overview of the proof of Theorem 1.1""; ""Almost perfect matchings""; ""Absorbing sets"" 327 $a""The auxiliary graph G""""References""; ""Fractional and integer matchings in uniform hypergraphs""; ""Large matchings in hypergraphs with many edges""; ""Large matchings in hypergraphs with large degrees""; ""Large fractional matchings""; ""References""; ""Cubic graphs""; ""On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings""; ""1 Introduction""; ""2 Aninfinite family of snarks with excessive index 5""; ""3 Shortest cycle cover""; ""4 Open problems""; ""References""; ""Relating ordinary and total domination in cubic graphs of large girth""; ""References"" 327 $a""Snarks with large oddness and small number of vertices""""1 Introduction""; ""2 Oddness and resistance ratios""; ""3 Lower bounds on oddness ratio""; ""4 Constructions""; ""References""; ""Non-trivial snarks with given circular chromatic index""; ""1 Introduction""; ""2 Balanced schemes""; ""References""; ""Graphs""; ""The graph formulation of the union-closed sets conjecture""; ""References""; ""The union-closed sets conjecture almost holds for almost all random bipartite graphs""; ""1 Introduction""; ""2 Discussion of averaging""; ""3 Sketch of the proof of Theorem 2.2""; ""References"" 327 $a""The robust component structure of dense regular graphs""""1 Introduction""; ""2 Two applications to longest cycles in regular graphs""; ""3 Sketch of the proof of Theorems 1.2 and 2.2""; ""3.1 Sketch proof of Theorem 1.2""; ""3.2 Sketch proof of Theorem 2.2""; ""References""; ""The (a???, D) and (a???, N) problemsin double-step digraphs with unilateral diameter""; ""1 Preliminaries""; ""1.1 Double-step digraphs""; ""1.2 Unilateral distance""; ""2 The unilateral diameter of double-step digraphs with step a=1"" 327 $a""3 The(a???, D*) and (a???,N)* problems for double-step digraphs with unilateral diameter"" 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,$x2239-4524 ;$v16 606 $aCombinatorial analysis 606 $aGraph theory 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aGraph Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M29020 615 0$aCombinatorial analysis. 615 0$aGraph theory. 615 14$aCombinatorics. 615 24$aGraph Theory. 676 $a511.5 676 $a511.6 702 $aNe?et?il$b Jaroslav$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPellegrini$b Marco$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910438136803321 996 $aThe Seventh European Conference on Combinatorics, Graph Theory and Applications$92529618 997 $aUNINA