The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs (Q6071822): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4388827789 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2798999 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Independent sets in hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3390427 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4382659 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4326638 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Simulation of Large-Scale Growth Models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Theorem on <i>k</i>-Saturated Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5734790 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a combinatorial conjecture of Erdös / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On hitting all maximum cliques with an independent set / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hypergraph containers / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:30, 20 August 2024
scientific article; zbMATH DE number 7771539
Language | Label | Description | Also known as |
---|---|---|---|
English | The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs |
scientific article; zbMATH DE number 7771539 |
Statements
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs (English)
0 references
29 November 2023
0 references
independent sets
0 references
hats
0 references
random graphs
0 references
combinatorics
0 references