23 search results - page 1 / 5 » Graphs Without Large Complete Minors Are Quasi-Random |
101
Voted
CPC
2002
15 years 1 months ago
2002
110
Voted
CPC
2004
15 years 1 months ago
2004
Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...
255
Voted
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
156
Voted
SODA
2012
ACM
13 years 4 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
116
Voted
EJC
2008
15 years 1 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...