Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 3 - Topological connectedness and independent sets in graphs

  • Edited by Allan Lo, University of Birmingham, Richard Mycroft, University of Birmingham, Guillem Perarnau, Universitat Politècnica de Catalunya, Barcelona, Andrew Treglown, University of Birmingham
  • Book:
    Surveys in Combinatorics 2019
    Published online:
    17 June 2019
    Print publication:
    27 June 2019, pp 89-114

  • Summary

    An abstract simplicial complex C is said to be k-connected if for each $-1\leq d\leq k$ and each continuous map f from the sphere $S^d$ to ||C|| (the body of the geometric realization of C), the map f can be extended to a continuous map from the ball $B^{d+1}$ to ||C||. In 2000 a link was discovered between the topological connectedness of the independence complex of a graph and various other important graph parameters to do with colouring and partitioning. When the graph represents some other combinatorial structure, for example when it is the line graph of a hypergraph H, this link can be exploited to obtain information such as lower bounds on the matching number of H. Since its discovery there have been many other applications of this phenomenon to combinatorial problems. The aim of this article is to outline this general method and to describe some of its applications.