The hat guessing number of graphs (Q777481): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3000929545 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1812.09752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomization of auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Equality in Communication Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nowhere-zero point in linear mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hat Guessing Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero Error List-Decoding Capacity of the q/(q–1) Channel / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Autoreducibility of Random Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero error capacity under list decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Separating Systems and Families of Perfect Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Dynamical Systems, Hat Games, and Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Constructions and Bounds for Winkler's Hat Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Problems of Lovász Concerning the Shannon Capacity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fredman–Komlós bounds and information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3171734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hat problem on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Index Coding Outperforming the Linear Optimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal representations over finite fields and the chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information flows, graphs and their guessing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Spencer / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three colour hat guessing game on cycle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2781064 / rank
 
Normal rank

Latest revision as of 01:09, 23 July 2024

scientific article
Language Label Description Also known as
English
The hat guessing number of graphs
scientific article

    Statements

    The hat guessing number of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 July 2020
    0 references
    hat guessing number
    0 references
    complete bipartite graph
    0 references
    Lovász local lemma
    0 references
    combinatorial nullstellensatz
    0 references

    Identifiers