On the clique number of a strongly regular graph (Q1991424): 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 / arXiv ID
 
Property / arXiv ID: 1604.08299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squares and difference sets in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of \(p^{\theta}\,mod\,1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: HEMISYSTEMS ON THE HERMITIAN SURFACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős–Ko–Rado Theorems: Algebraic Approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4767350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on block intersection polynomials and new applications to graphs and block designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in edge-regular graphs / rank
 
Normal rank

Latest revision as of 04:07, 17 July 2024

scientific article
Language Label Description Also known as
English
On the clique number of a strongly regular graph
scientific article

    Statements

    On the clique number of a strongly regular graph (English)
    0 references
    30 October 2018
    0 references
    Summary: We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including infinitely many parameter tuples that correspond to Paley graphs.
    0 references
    Delsarte bound
    0 references
    Hoffman bound
    0 references
    block intersection polynomial
    0 references
    clique number
    0 references
    conference graphs
    0 references
    strongly regular graphs
    0 references
    clique adjacency bound
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers