05892nam 22006735 450 991043813680332120200701090943.088-7642-475-X10.1007/978-88-7642-475-5(CKB)2550000001200046(EBL)1698018(OCoLC)881166068(SSID)ssj0001187524(PQKBManifestationID)11688480(PQKBTitleCode)TC0001187524(PQKBWorkID)11257521(PQKB)10265486(DE-He213)978-88-7642-475-5(MiAaPQ)EBC1698018(PPN)176127542(EXLCZ)99255000000120004620140118d2013 u| 0engur|n|---|||||txtccrThe Seventh European Conference on Combinatorics, Graph Theory and Applications EuroComb 2013 /edited by Jaroslav Nešetřil, Marco Pellegrini1st ed. 2013.Pisa :Scuola Normale Superiore :Imprint: Edizioni della Normale,2013.1 online resource (612 p.)CRM Series,2239-4524 ;16Description based upon print version of record.88-7642-474-1 Includes bibliographical references at the end of each chapters.""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""""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""""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""""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""""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""""3 The(â??, D*) and (â??,N)* problems for double-step digraphs with unilateral diameter""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.CRM Series,2239-4524 ;16Combinatorial analysisGraph theoryCombinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Graph Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/M29020Combinatorial analysis.Graph theory.Combinatorics.Graph Theory.511.5511.6Nešetřil Jaroslavedthttp://id.loc.gov/vocabulary/relators/edtPellegrini Marcoedthttp://id.loc.gov/vocabulary/relators/edtBOOK9910438136803321The Seventh European Conference on Combinatorics, Graph Theory and Applications2529618UNINA