The chromatic number of random Cayley graphs (Q2509709): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2013.05.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967114635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large sets in finite fields are sumsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with sparse neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: List coloring of random and pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repeated communication and Ramsey graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform dilations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Cayley graphs and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform expansion bounds for Cayley graphs of \(\text{SL}_2(\mathbb F_p)\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random runners are very lonely / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Latin square graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting sets with small sumset, and the clique number of random Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON EIGENVALUES AND COLORINGS OF GRAPHS, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Cayley graphs are expanders: a simple proof of the Alon-Roichman theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of cube-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number: A survey / rank
 
Normal rank

Latest revision as of 19:13, 8 July 2024

scientific article
Language Label Description Also known as
English
The chromatic number of random Cayley graphs
scientific article

    Statements

    The chromatic number of random Cayley graphs (English)
    0 references
    0 references
    29 July 2014
    0 references
    lonely runner problem
    0 references
    Diophantine approximation
    0 references
    integer distance graphs
    0 references

    Identifiers