On the number of complete subgraphs contained in certain graphs

DOI10.1016/0095-8956(81)90054-XzbMath0475.05049OpenAlexW2115164934WikidataQ29396799 ScholiaQ29396799MaRDI QIDQ1159691

Ronald J. Evans, J. R. Pulham, John Sheehan

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90054-x

zbMATH Keywords

Paley graphcomplete subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items

Triple intersection numbers for the Paley graphs, On tripartite common graphs, Generalized Paley graphs and their complete subgraphs of orders three and four, Hypergeometric functions for Dirichlet characters and Peisert-like graphs on \(\mathbb{Z}_n\), On eigenfunctions and maximal cliques of generalised Paley graphs of square order, Number of complete subgraphs of peisert graphs and finite field hypergeometric functions, Strongly regular graphs and finite Ramsey theory, On finite Ramsey numbers, A note on the inducibility of 4-vertex graphs, Values of Gaussian hypergeometric series, Hypergeometric Functions Over Finite Fields, Special values of hypergeometric functions over finite fields, Character sum analogues of constant term identities for root systems, On a Paley-type graph on \({\mathbb{Z}}_n\), A character sum evaluation and Gaussian hypergeometric series

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Identities for products of Gauss sums over finite fields
• Sums of Gauss, Jacobi, and Jacobsthal
• On Sets of Acquaintances and Strangers at any Party
• On the cubes of Kloosterman sums
• Combinatorial Relations and Chromatic Graphs