A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5688995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to the rank-coloring conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4594195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear-array conjecture in communication complexity is false / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity and combinatorial lattice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite coverings and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rank vs. communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of a theorem of Graham and Pollak / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ``log rank''-conjecture in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decomposition ofkn into complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial space proof of the Graham-Pollak theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of neighborly families of convex polytopes / rank
 
Normal rank

Latest revision as of 17:20, 5 July 2024

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
    0 references
    0 references
    17 September 2012
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references