Fair splittings by independent sets in sparse graphs (Q2182042): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Fair Representation by Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair splitting of colored paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic methods in coloring and decomposition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Chromatic Number of Kneser Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tverberg plus constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for the colored Tverberg problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying unavoidable Tverberg partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local criterion for Tverberg graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection patterns of finite sets and of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Numbers of Stable Kneser Hypergraphs via Topological Tverberg-Type Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5511980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A condition for matchability in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Vertex List Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tverberg's theorem with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of almost stable Kneser hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kuratowski complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of Radon's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kneser coloring theorems with combinatorial proofs / rank
 
Normal rank

Revision as of 17:25, 22 July 2024

scientific article
Language Label Description Also known as
English
Fair splittings by independent sets in sparse graphs
scientific article

    Statements

    Fair splittings by independent sets in sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 May 2020
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references