Exact results on generalized Erdős-Gallai problems
From MaRDI portal
Publication:6568830
DOI10.1016/j.ejc.2024.103955zbMath1543.05082MaRDI QIDQ6568830
Debsoumya Chakraborti, Da Qi Chen
Publication date: 8 July 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items (3)
The maximum number of cliques in graphs with bounded odd circumference ⋮ Exact generalized Turán numbers for even linear forests ⋮ A localized approach to generalized Turán problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independent sets in graphs with given minimum degree
- On 3-uniform hypergraphs without a cycle of a given length
- Sur une inégalité relative aux fonctions convexes.
- Congruent graphs and the connectivity of graphs
- Two problems on independent sets in graphs
- On the maximum number of five-cycles in a triangle-free graph
- On the maximum size of connected hypergraphs without a path of given length
- Face vectors of flag complexes
- Pentagons vs. triangles
- The maximum number of cliques in graphs without long cycles
- Path Ramsey numbers in multicolorings
- On the number of pentagons in triangle-free graphs
- Many cliques with few edges and bounded maximum degree
- General lemmas for Berge-Turán hypergraph problems
- Many cliques with few edges
- Many triangles with few edges
- The maximum number of complete subgraphs in a graph with given maximum degree
- The Maximum Number of Triangles in C2k+1-Free Graphs
- The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree
- On maximal paths and circuits of graphs
- A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs
- Shadows of colored complexes.
- Maximal circuits of graphs. I
- The maximum number of triangles in a graph of given maximum degree
- Many H-Copies in Graphs with a Forbidden Tree
- Extensions of the Erdős–Gallai theorem and Luo’s theorem
- Maximizing the Number of Independent Sets of a Fixed Size
- On Independent Sets in Graphs with Given Minimum Degree
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree
- Some Theorems on Abstract Graphs
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Exact results on generalized Erdős-Gallai problems