OP-9622Graph theoryStatus unassessed
On the clique number of the Paley Graph — Problem 29
On the clique number of the Paley Graph — Problem 29
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
MSC2020 · 05Cxx
Graph theory
Graph theory \{For computer science, see 68R10\}
854 mapped entries · Browse and filter all →
Counts include all statuses and descendants. Classifications are editorial or inferred from community fields, not an AMS assessment of the problem.
Subcategories
05C05Trees205C07Vertex degrees005C09Graphical indices (Wiener index, Zagreb index, Randi? index, etc.)005C10Planar graphs; geometric and topological aspects of graph theory405C12Distance in graphs005C15Coloring of graphs and hypergraphs405C17Perfect graphs005C20Directed graphs (digraphs), tournaments005C21Flows in graphs005C22Signed and weighted graphs005C25Graphs and abstract algebra (groups, rings, fields, etc.)005C30Enumeration in graph theory005C31Graph polynomials005C35Extremal problems in graph theory305C38Paths and cycles105C40Connectivity005C42Density (toughness, etc.)005C45Eulerian and Hamiltonian graphs005C48Expander graphs005C50Graphs and linear algebra (matrices, eigenvalues, etc.)005C51Graph designs and isomorphic decomposition005C55Generalized Ramsey theory305C57Games on graphs (graph-theoretic aspects)005C60Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)005C62Graph representations (geometric and intersection representations, etc.)205C63Infinite graphs005C65Hypergraphs105C69Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)105C70Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)005C72Fractional graph theory, fuzzy graph theory005C75Structural characterization of families of graphs005C76Graph operations (line graphs, products, etc.)005C78Graph labelling (graceful graphs, bandwidth, etc.)005C80Random graphs (graph-theoretic aspects)005C81Random walks on graphs005C82Small world graphs, complex networks (graph-theoretic aspects)005C83Graph minors005C85Graph algorithms (graph-theoretic aspects)005C90Applications of graph theory005C92Chemical graph theory005C99Graph theory0
Mapped problems
OP-9621Graph theoryStatus unassessed
On the clique number of the Paley Graph — Problem 28
On the clique number of the Paley Graph — Problem 28
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
OP-9620Graph theoryStatus unassessed
On the clique number of the Paley Graph — Problem 27
On the clique number of the Paley Graph — Problem 27
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
OP-9619Graph theoryStatus unassessed
On the clique number of the Paley Graph — Problem 26
On the clique number of the Paley Graph — Problem 26
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
OP-9618Graph theoryStatus unassessed
On the clique number of the Paley Graph — Problem 25
On the clique number of the Paley Graph — Problem 25
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
OP-9612Graph theoryStatus unassessed
The Lovász number of random circulant graphs — Problem 18
The Lovász number of random circulant graphs — Problem 18
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
OP-9611Graph theoryStatus unassessed
The Lovász number of random circulant graphs — Problem 17
The Lovász number of random circulant graphs — Problem 17
Randomstrasse101 — Open Problems of 2025· Specialist source · status unassessed
OP-9393Graph theoryOpen
Erdős #1182 · graph theory / ramsey theory
Let f(n) be maximal such that there is a connected graph G with n vertices and f(n) edges such that R(K 3,G)= 2n-1. Let F(n) be maximal such that every connected graph G with n vertices and $ leq F(…
Erdős Problems (Thomas Bloom)· Source reports OPEN
OP-9391Graph theoryOpen
Erdős #1178 · graph theory / hypergraphs
For r geq 3 let d r(e) be the minimal d such that mathrm ex r(n, mathcal F )=o(n^2), where mathcal F is the family of r -uniform hypergraphs on d vertices with e edges. Prove that d r(e)=(r-…
Erdős Problems (Thomas Bloom)· Source reports OPEN
OP-9376Graph theoryOpen
Erdős #1156 · graph theory / chromatic number
Let G be a random graph on n vertices, in which every edge is included independently with probability 1/2 . Is there some constant C such that that chromatic number chi(G) is, almost surely, concentrated on a…
Erdős Problems (Thomas Bloom)· Source reports OPEN
Journals & articles in MSC 05
These are selected sources for the parent class. Article coverage is a first reviewed selection, and may not cover this exact subcategory.
Electronic Journal of Combinatorics
Combinatorics and graph theory
Journal discovery is available; article-level extraction for this class is not yet included in this batch.
View source evidence →MSC2020 © Mathematical Reviews (AMS) and zbMATH · CC BY-NC-SA 4.0 · Official PDF, page 12