Balanced independent sets in graphs omitting large cliques
type: Item
instance of: scholarly article
title: Balanced independent sets in graphs omitting large cliques
zbMATH Open document ID: 1416.05212
author: Claude Laflamme
author: Andrés Aranda
author: Dániel T. Soukup
author: R. E. Woodrow
published in: Journal of Combinatorial Theory. Series B
publication date: 2019-07-17T00:00:00Z
full work available at URL: https://arxiv.org/abs/1611.06142
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7081256
zbMATH Keywords: independent
zbMATH Keywords: transversal
zbMATH Keywords: balanced
zbMATH Keywords: partition
zbMATH Keywords: clique
zbMATH Keywords: \(K_n\)-free
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2963505277
arXiv ID: 1611.06142
cites work: Q4100117
cites work: On complete subgraphs of \(r\)-chromatic graphs
cites work: Nonsymmetric party problems
cites work: Proof of a conjecture of B. Ruziewicz
cites work: On Forming Committees
cites work: Odd Independent Transversals are Odd
cites work: A universal partition result for infinite homogeneous \(K_n\)-free and related graphs
Wikidata QID: Q128855659
DOI: 10.1016/J.JCTB.2018.11.006
description: scientific article