Extremal problems for cycles in graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2170455
- scientific article; zbMATH DE number 140120
- scientific article; zbMATH DE number 1151856
- An extremal problem for cycles in hamiltonian graphs
- scientific article; zbMATH DE number 3191789
- scientific article; zbMATH DE number 3258067
- Extremal problems involving vertices and edges on odd cycles
- Some extremal problems on the cycle length distribution of graphs
- scientific article; zbMATH DE number 1101882
- scientific article; zbMATH DE number 3333193
Cited in
(63)- Extremal problems involving vertices and edges on odd cycles
- Long cycles in Hamiltonian graphs
- Extremal problems on components and loops in graphs
- Cycles of given lengths in hypergraphs
- Compactness results in extremal graph theory
- On grids in point-line arrangements in the plane
- Sublinear-time distributed algorithms for detecting small cliques and even cycles
- Twisted cubic and plane-line incidence matrix in \(\mathrm{PG}(3,q)\)
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- Generalized Turán problems for even cycles
- Bicyclic graphs with extremal cover cost
- On a conjecture of Bondy and Vince
- Covering point-sets with parallel hyperplanes and sparse signal recovery
- Triangles in graphs without bipartite suspensions
- The Turán number of directed paths and oriented cycles
- Some open problems on cycles
- scientific article; zbMATH DE number 140120 (Why is no real title available?)
- scientific article; zbMATH DE number 1101882 (Why is no real title available?)
- scientific article; zbMATH DE number 1943958 (Why is no real title available?)
- On tight cycles in hypergraphs
- scientific article; zbMATH DE number 2170455 (Why is no real title available?)
- Extremal numbers of cycles revisited
- Ramsey numbers for nontrivial Berge cycles
- Large hypergraphs without tight cycles
- Hypergraphs with no tight cycles
- On the extremal number of subdivisions
- The Extremal Number of Tight Cycles
- On Grids in Point-Line Arrangements in the Plane
- Construction of optimal locally recoverable codes and connection with hypergraph
- Cycles of many lengths in Hamiltonian graphs
- The extremal function for cycles of length \(\ell\) mod \(k\)
- Facets of the stochastic network flow problem
- Sparse hypergraphs with applications to coding theory
- Relative Turán problems for uniform hypergraphs
- A strengthening on odd cycles in graphs of given chromatic number
- On absorbing cycles in min-max digraphs
- Even cycles in graphs with many odd cycles
- Linear cycles of consecutive lengths
- Properly colored cycles of different lengths in edge-colored complete graphs
- On the maximum number of odd cycles in graphs without smaller odd cycles
- Counting hypergraphs with large girth
- Uniform Turán density of cycles
- Incidence matrices for the class \({\mathcal{O}}_6\) of lines external to the twisted cubic in \(\mathrm{PG}(3,q)\)
- A solution to Erdős and Hajnal’s odd cycle problem
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Turán‐type problems for long cycles in random and pseudo‐random graphs
- The asymptotics of r(4,t)
- Extremal numbers of hypergraph suspensions of even cycles
- Chvátal-Erdős condition for pancyclicity
- On Hamiltonian decompositions of complete 3-uniform hypergraphs
- Ramsey numbers and a general Erdős-Rogers function
- Ramsey numbers and the Zarankiewicz problem
- Generalized Turán problems for even cycles
- On the maximum number of odd cycles in graphs without smaller odd cycles
- The extremal number of cycles with all diagonals
- A localized approach for Turán number of long cycles
- On graphs without cycles of length 0 modulo 4
- A generalization of Bondy's pancyclicity theorem
- A note on two cycles of consecutive even lengths in graphs
- Chvátal-Erdős condition for pancyclicity (extended abstract)
- A generalization of Bondy's pancyclicity theorem (extended abstract)
- Edge-disjoint cycles with the same vertex set
- Pancyclicity of Hamiltonian graphs
This page was built for publication: Extremal problems for cycles in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957176)
