On the chromatic number of random subgraphs of a certain distance graph (Q2322889): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2019.07.002 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2019.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962679774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring some finite sets in {R}^{n} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers and chromatic numbers of the random subgraphs of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of small-dimensional Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of low-dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple removal lemma for large nearly-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of random subgraphs of some distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On “stability” in the Erdös--Ko--Rado Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidding just one intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bound for the chromatic number of a random subgraph of a distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of an infinitesimal plane layer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a random subgraph of the Kneser graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random subgraphs of Kneser and Schrijver graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Kneser graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realization of distances within sets in Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of random subgraphs of a distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the independence number of a random subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique chromatic numbers of intersection graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127446295 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2019.07.002 / rank
 
Normal rank

Latest revision as of 00:10, 18 December 2024

scientific article
Language Label Description Also known as
English
On the chromatic number of random subgraphs of a certain distance graph
scientific article

    Statements

    On the chromatic number of random subgraphs of a certain distance graph (English)
    0 references
    0 references
    5 September 2019
    0 references
    chromatic number
    0 references
    independence number
    0 references
    distance graph
    0 references
    0 references

    Identifiers