Borrow it
 Albert D. Cohen Management Library
 Architecture/Fine Arts Library
 Archives and Special Collections
 Bibliothèque AlfredMonnin (Université de SaintBoniface)
 Bill Larson Library (Grace Hospital)
 Carolyn Sifton  Helene Fuld Library (St. Boniface General Hospital)
 Concordia Hospital Library
 Donald W. Craik Engineering Library
 E.K. Williams Law Library
 EckhardtGramatté Music Library
 Elizabeth Dafoe Library
 Fr. H. Drake Library (St. Paul's College)
 J.W. Crane Memorial Library (Deer Lodge Centre)
 Libraries Annex (not open to the public; please see web page for details)
 Neil John Maclean Health Sciences Library
 Sciences and Technology Library
 Seven Oaks General Hospital Library
 Sister St. Odilon Library (Misericordia Health Centre)
 St. John's College Library
 Victoria General Hospital Library
 William R Newman Library (Agriculture)
The Resource The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013, edited by Jaroslav Nešetřil, Marco Pellegrini, (electronic resource)
The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013, edited by Jaroslav Nešetřil, Marco Pellegrini, (electronic resource)
Resource Information
The item The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013, edited by Jaroslav Nešetřil, Marco Pellegrini, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Manitoba Libraries.This item is available to borrow from all library branches.
Resource Information
The item The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013, edited by Jaroslav Nešetřil, Marco Pellegrini, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Manitoba Libraries.
This item is available to borrow from all library branches.
 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
 Language

 eng
 eng
 Edition
 1st ed. 2013.
 Extent
 1 online resource (612 p.)
 Note
 Description based upon print version of record
 Contents

 ""Cover""; ""Title Page""; ""Copyright Page""; ""Table of Contents""; ""Foreword""; ""Invited Speakers""; ""ErdÅ?s problems""; ""A problem of ErdÅ?s and SÃ3s on 3graphs""; ""1 Introduction""; ""2 Sketch of the proof""; ""References""; ""An analogue of the ErdÅ?sKoRado 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 ErdÅ?sâ€?PÃ3sa theorem""; ""1 Introduction""; ""2 Excluding packings of planar graphs""; ""References""
 ""The ErdÅ?sPÃ3sa property for long circuits""""1 Introduction""; ""2 Proof of Theorem 1.1""; ""References""; ""Hypergraphs""; ""A hypergraph TurÃ¡n theorem via Lagrangians of intersecting families""; ""1 Introduction""; ""2 Lagrangians of intersecting 3graphs""; ""3 An application to a hypergraph TurÃ¡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 edgeset 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""; ""Nontrivial snarks with given circular chromatic index""; ""1 Introduction""; ""2 Balanced schemes""; ""References""; ""Graphs""; ""The graph formulation of the unionclosed sets conjecture""; ""References""; ""The unionclosed 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 (â??, D) and (â??, N) problemsin doublestep digraphs with unilateral diameter""; ""1 Preliminaries""; ""1.1 Doublestep digraphs""; ""1.2 Unilateral distance""; ""2 The unilateral diameter of doublestep digraphs with step a=1""
 ""3 The(â??, D*) and (â??,N)* problems for doublestep digraphs with unilateral diameter""
 Isbn
 9788876424755
 Label
 The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013
 Title
 The Seventh European Conference on Combinatorics, Graph Theory and Applications
 Title remainder
 EuroComb 2013
 Statement of responsibility
 edited by Jaroslav Nešetřil, Marco Pellegrini
 Language

 eng
 eng
 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
 Dewey number

 511.5
 511.6
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt

 KQIUjqJBUH8
 p2C4wqJ_UHI
 Language note
 English
 LC call number
 QA164167.2
 Literary form
 non fiction
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName

 Nešetřil, Jaroslav.
 Pellegrini, Marco.
 Series statement
 CRM Series,
 Series volume
 16
 http://library.link/vocab/subjectName

 Combinatorics
 Combinatorics
 Graph Theory
 Label
 The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013, edited by Jaroslav Nešetřil, Marco Pellegrini, (electronic resource)
 Note
 Description based upon print version of record
 Bibliography note
 Includes bibliographical references at the end of each chapters
 Carrier category
 online resource
 Carrier category code

 cr
 Content category
 text
 Content type code

 txt
 Contents

 ""Cover""; ""Title Page""; ""Copyright Page""; ""Table of Contents""; ""Foreword""; ""Invited Speakers""; ""ErdÅ?s problems""; ""A problem of ErdÅ?s and SÃ3s on 3graphs""; ""1 Introduction""; ""2 Sketch of the proof""; ""References""; ""An analogue of the ErdÅ?sKoRado 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 ErdÅ?sâ€?PÃ3sa theorem""; ""1 Introduction""; ""2 Excluding packings of planar graphs""; ""References""
 ""The ErdÅ?sPÃ3sa property for long circuits""""1 Introduction""; ""2 Proof of Theorem 1.1""; ""References""; ""Hypergraphs""; ""A hypergraph TurÃ¡n theorem via Lagrangians of intersecting families""; ""1 Introduction""; ""2 Lagrangians of intersecting 3graphs""; ""3 An application to a hypergraph TurÃ¡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 edgeset 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""; ""Nontrivial snarks with given circular chromatic index""; ""1 Introduction""; ""2 Balanced schemes""; ""References""; ""Graphs""; ""The graph formulation of the unionclosed sets conjecture""; ""References""; ""The unionclosed 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 (â??, D) and (â??, N) problemsin doublestep digraphs with unilateral diameter""; ""1 Preliminaries""; ""1.1 Doublestep digraphs""; ""1.2 Unilateral distance""; ""2 The unilateral diameter of doublestep digraphs with step a=1""
 ""3 The(â??, D*) and (â??,N)* problems for doublestep digraphs with unilateral diameter""
 Dimensions
 unknown
 Edition
 1st ed. 2013.
 Extent
 1 online resource (612 p.)
 Form of item
 online
 Isbn
 9788876424755
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/9788876424755
 Specific material designation
 remote
 System control number

 (CKB)2550000001200046
 (EBL)1698018
 (OCoLC)881166068
 (SSID)ssj0001187524
 (PQKBManifestationID)11688480
 (PQKBTitleCode)TC0001187524
 (PQKBWorkID)11257521
 (PQKB)10265486
 (DEHe213)9788876424755
 (MiAaPQ)EBC1698018
 (EXLCZ)992550000001200046
 Label
 The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013, edited by Jaroslav Nešetřil, Marco Pellegrini, (electronic resource)
 Note
 Description based upon print version of record
 Bibliography note
 Includes bibliographical references at the end of each chapters
 Carrier category
 online resource
 Carrier category code

 cr
 Content category
 text
 Content type code

 txt
 Contents

 ""Cover""; ""Title Page""; ""Copyright Page""; ""Table of Contents""; ""Foreword""; ""Invited Speakers""; ""ErdÅ?s problems""; ""A problem of ErdÅ?s and SÃ3s on 3graphs""; ""1 Introduction""; ""2 Sketch of the proof""; ""References""; ""An analogue of the ErdÅ?sKoRado 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 ErdÅ?sâ€?PÃ3sa theorem""; ""1 Introduction""; ""2 Excluding packings of planar graphs""; ""References""
 ""The ErdÅ?sPÃ3sa property for long circuits""""1 Introduction""; ""2 Proof of Theorem 1.1""; ""References""; ""Hypergraphs""; ""A hypergraph TurÃ¡n theorem via Lagrangians of intersecting families""; ""1 Introduction""; ""2 Lagrangians of intersecting 3graphs""; ""3 An application to a hypergraph TurÃ¡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 edgeset 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""; ""Nontrivial snarks with given circular chromatic index""; ""1 Introduction""; ""2 Balanced schemes""; ""References""; ""Graphs""; ""The graph formulation of the unionclosed sets conjecture""; ""References""; ""The unionclosed 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 (â??, D) and (â??, N) problemsin doublestep digraphs with unilateral diameter""; ""1 Preliminaries""; ""1.1 Doublestep digraphs""; ""1.2 Unilateral distance""; ""2 The unilateral diameter of doublestep digraphs with step a=1""
 ""3 The(â??, D*) and (â??,N)* problems for doublestep digraphs with unilateral diameter""
 Dimensions
 unknown
 Edition
 1st ed. 2013.
 Extent
 1 online resource (612 p.)
 Form of item
 online
 Isbn
 9788876424755
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/9788876424755
 Specific material designation
 remote
 System control number

 (CKB)2550000001200046
 (EBL)1698018
 (OCoLC)881166068
 (SSID)ssj0001187524
 (PQKBManifestationID)11688480
 (PQKBTitleCode)TC0001187524
 (PQKBWorkID)11257521
 (PQKB)10265486
 (DEHe213)9788876424755
 (MiAaPQ)EBC1698018
 (EXLCZ)992550000001200046
Library Locations

Albert D. Cohen Management LibraryBorrow it181 Freedman Crescent, Winnipeg, MB, R3T 5V4, CA49.807878 97.129961


Archives and Special CollectionsBorrow it25 Chancellors Circle (Elizabeth Dafoe Library), Room 330, Winnipeg, MB, R3T 2N2, CA49.809961 97.131878

Bibliothèque AlfredMonnin (Université de SaintBoniface)Borrow it200, avenue de la Cathédrale, Local 2110, Winnipeg, MB, R2H 0H7, CA49.888861 97.119735

Bill Larson Library (Grace Hospital)Borrow it300 Booth Drive, G227, Winnipeg, MB, R3J 3M7, CA49.882400 97.276436

Carolyn Sifton  Helene Fuld Library (St. Boniface General Hospital)Borrow it409 Tache Avenue, Winnipeg, MB, R2H 2A6, CA49.883388 97.126050

Concordia Hospital LibraryBorrow it1095 Concordia Avenue, Winnipeg, MB, R2K 3S8, CA49.913252 97.064683

Donald W. Craik Engineering LibraryBorrow it75B Chancellors Circle (Engineering Building E3), Room 361, Winnipeg, MB, R3T 2N2, CA49.809053 97.133292


EckhardtGramatté Music LibraryBorrow it136 Dafoe Road (Taché Arts Complex), Room 257, Winnipeg, MB, R3T 2N2, CA49.807964 97.132222

Elizabeth Dafoe LibraryBorrow it25 Chancellors Circle, Winnipeg, MB, R3T 2N2, CA49.809961 97.131878

Fr. H. Drake Library (St. Paul's College)Borrow it70 Dysart Road, Winnipeg, MB, R3T 2M6, CA49.810605 97.138184

J.W. Crane Memorial Library (Deer Lodge Centre)Borrow it2109 Portage Avenue, Winnipeg, MB, R3J 0L3, CA49.878000 97.235520

Libraries Annex (not open to the public; please see web page for details)Borrow it25 Chancellors Circle (in the Elizabeth Dafoe Library), Winnipeg, MB, R3T 2N2, CA49.809961 97.131878

Neil John Maclean Health Sciences LibraryBorrow it727 McDermot Avenue (Brodie Centre), 200 Level, Winnipeg, MB, R3E 3P5, CA49.903563 97.160554

Sciences and Technology LibraryBorrow it186 Dysart Road, Winnipeg, MB, R3T 2M8, CA49.811526 97.133257

Seven Oaks General Hospital LibraryBorrow it2300 McPhillips Street, Winnipeg, MB, R2V 3M3, CA49.955177 97.148865

Sister St. Odilon Library (Misericordia Health Centre)Borrow it99 Cornish Avenue, Winnipeg, MB, R3C 1A2, CA49.879592 97.160425


Victoria General Hospital LibraryBorrow it2340 Pembina Highway, Winnipeg, MB, R3T 2E8, CA49.806755 97.152739

William R Newman Library (Agriculture)Borrow it66 Dafoe Road, Winnipeg, MB, R3T 2R3, CA49.806936 97.135525
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.lib.umanitoba.ca/portal/TheSeventhEuropeanConferenceonCombinatorics/GmlFpY_sGKM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.lib.umanitoba.ca/portal/TheSeventhEuropeanConferenceonCombinatorics/GmlFpY_sGKM/">The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013, edited by Jaroslav Nešetřil, Marco Pellegrini, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.lib.umanitoba.ca/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.lib.umanitoba.ca/">University of Manitoba Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013, edited by Jaroslav Nešetřil, Marco Pellegrini, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.lib.umanitoba.ca/portal/TheSeventhEuropeanConferenceonCombinatorics/GmlFpY_sGKM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.lib.umanitoba.ca/portal/TheSeventhEuropeanConferenceonCombinatorics/GmlFpY_sGKM/">The Seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013, edited by Jaroslav Nešetřil, Marco Pellegrini, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.lib.umanitoba.ca/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.lib.umanitoba.ca/">University of Manitoba Libraries</a></span></span></span></span></div>