Bad news for chordal partitions

Alex Scott; Paul Seymour; David R Wood

doi:10.1002/jgt.22363

Bad news for chordal partitions

Alex Scott, Paul Seymour, David R Wood

School of Mathematics

Research output: Contribution to journal › Article › Research › peer-review

2 Citations (Scopus)

Abstract

Reed and Seymour [1998] asked whether every graph has a partition into induced connected nonempty bipartite subgraphs such that the quotient graph is chordal. If true, this would have significant ramifications for Hadwiger's Conjecture. We prove that the answer is “no.” In fact, we show that the answer is still “no” for several relaxations of the question.

Original language	English
Pages (from-to)	5-12
Number of pages	8
Journal	Journal of Graph Theory
Volume	90
Issue number	1
DOIs	https://doi.org/10.1002/jgt.22363
Publication status	Published - 1 Jan 2019

Keywords

chordal partition
graph
Hadwiger's conjecture
minor
partition

Access to Document

10.1002/jgt.22363

Cite this

@article{1c3167d4bb8e49cca3323dea8987c4bf,

title = "Bad news for chordal partitions",

abstract = "Reed and Seymour [1998] asked whether every graph has a partition into induced connected nonempty bipartite subgraphs such that the quotient graph is chordal. If true, this would have significant ramifications for Hadwiger's Conjecture. We prove that the answer is “no.” In fact, we show that the answer is still “no” for several relaxations of the question.",

keywords = "chordal partition, graph, Hadwiger's conjecture, minor, partition",

author = "Alex Scott and Paul Seymour and Wood, {David R}",

year = "2019",

month = jan,

day = "1",

doi = "10.1002/jgt.22363",

language = "English",

volume = "90",

pages = "5--12",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "John Wiley & Sons",

number = "1",

}

TY - JOUR

T1 - Bad news for chordal partitions

AU - Scott, Alex

AU - Seymour, Paul

AU - Wood, David R

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Reed and Seymour [1998] asked whether every graph has a partition into induced connected nonempty bipartite subgraphs such that the quotient graph is chordal. If true, this would have significant ramifications for Hadwiger's Conjecture. We prove that the answer is “no.” In fact, we show that the answer is still “no” for several relaxations of the question.

AB - Reed and Seymour [1998] asked whether every graph has a partition into induced connected nonempty bipartite subgraphs such that the quotient graph is chordal. If true, this would have significant ramifications for Hadwiger's Conjecture. We prove that the answer is “no.” In fact, we show that the answer is still “no” for several relaxations of the question.

KW - chordal partition

KW - graph

KW - Hadwiger's conjecture

KW - minor

KW - partition

UR - http://www.scopus.com/inward/record.url?scp=85056389727&partnerID=8YFLogxK

U2 - 10.1002/jgt.22363

DO - 10.1002/jgt.22363

M3 - Article

AN - SCOPUS:85056389727

SN - 0364-9024

VL - 90

SP - 5

EP - 12

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 1

ER -

Bad news for chordal partitions

Abstract

Keywords

Access to Document

Other files and links

Graph colouring via entropy compression

Cite this

Bad news for chordal partitions

Abstract

Keywords

Access to Document

Other files and links

Projects

Graph colouring via entropy compression

Cite this