A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6083220 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bipartite graphs | |||
Property / zbMATH Keywords: bipartite graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
disjoint union | |||
Property / zbMATH Keywords: disjoint union / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
chromatic number | |||
Property / zbMATH Keywords: chromatic number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Alon-Saks-Seymour conjecture | |||
Property / zbMATH Keywords: Alon-Saks-Seymour conjecture / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
counterexample | |||
Property / zbMATH Keywords: counterexample / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
communication complexity | |||
Property / zbMATH Keywords: communication complexity / rank | |||
Normal rank |
Revision as of 11:50, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A counterexample to the Alon-Saks-Seymour conjecture and related problems |
scientific article |
Statements
A counterexample to the Alon-Saks-Seymour conjecture and related problems (English)
0 references
17 September 2012
0 references
bipartite graphs
0 references
disjoint union
0 references
chromatic number
0 references
Alon-Saks-Seymour conjecture
0 references
counterexample
0 references
communication complexity
0 references