Cycles of even length in graphs
From MaRDI portal
Publication:1844243
Cites work
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- Large cycles in graphs
- Minimal Regular Graphs of Girths Eight and Twelve
- On Graphs that do not Contain a Thomsen Graph
- On Minimal graphs of maximum even girth
- On some extremal problems in graph theory
- On the structure of linear graphs
Cited in
(only showing first 100 items - show all)- Shifted products that are coprime pure powers
- Graphs without theta subgraphs
- Large cycles in large labelled graphs
- Ramsey-type numbers involving graphs and hypergraphs with large girth
- Color isomorphic even cycles and a related Ramsey problem
- Making an H $H$‐free graph k $k$‐colorable
- Counting H-free orientations of graphs
- Turán numbers for hypergraph star forests
- Generalized Turán problems for disjoint copies of graphs
- Degree Ramsey numbers for even cycles
- Subexponential-time algorithms for finding large induced sparse subgraphs
- On cycle lengths in graphs of moderate degree
- Acyclic edge-colorings of sparse graphs
- A new upper bound on extremal number of even cycles
- On the Number of Cycles in a Graph with Restricted Cycle Lengths
- Improved upper bounds for parent-identifying set systems and separable codes
- Graphs with few paths of prescribed length between any two vertices
- Generalized multiplicative Sidon sets
- Adjacency eigenvalues of graphs without short odd cycles
- Generalized rainbow Turán problems
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- Bipartite Turán problems for ordered graphs
- Solving the \textsc{induced subgraph} problem in the randomized multiparty simultaneous messages model
- Parity check matrices and product representations of squares
- The impact of locality in the broadcast congested clique model
- Max-bisections of \(H\)-free graphs
- Distance colouring without one cycle length
- A hierarchy of lower bounds for sublinear additive spanners
- The complete closure of a graph
- Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs
- Subdivisions of a large clique in \(C_6\)-free graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On 14-Cycle-Free Subgraphs of the Hypercube
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
- Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Extremal even-cycle-free subgraphs of the complete transposition graphs
- Maximum bisections of graphs without short even cycles
- Forbidding multiple copies of forestable graphs
- Extremal theory and bipartite graph-tree Ramsey numbers
- Generalized Turán problems for even cycles
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- Bipartite algebraic graphs without quadrilaterals
- Planar Turán numbers on short cycles of consecutive lengths
- Planar Turán numbers of short paths
- Finding any given 2‐factor in sparse pseudorandom graphs efficiently
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
- A note on short cycles in a hypercube
- Distance colouring without one cycle length
- Stability results for vertex Turán problems in Kneser graphs
- Generalized Turán problems for even cycles
- Degree bipartite Ramsey numbers
- Extremal results for \(C_3^-\)-free signed graphs
- Finding even cycles even faster
- Turán problem of signed graph for negative odd cycle
- Forbidding \(K_{2,t}\) traces in triple systems
- Multicolor Ramsey numbers of bipartite graphs and large books
- Turán theorems for even cycles in random hypergraph
- On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles
- Supersaturation of even linear cycles in linear hypergraphs
- Chvátal-Erdős condition for pancyclicity
- Pancyclic subgraphs of random graphs
- scientific article; zbMATH DE number 7765381 (Why is no real title available?)
- Extremal numbers of hypergraph suspensions of even cycles
- Generalized regular Turán numbers
- Turán problems for oriented graphs
- On sparse parity check matrices (extended abstract)
- Random polynomial graphs for random Turán problems
- Extremal numbers for cycles in a hypercube
- Linear cycles of consecutive lengths
- Bipartite-ness under smooth conditions
- On locally rainbow colourings
- Maximal colourings for graphs
- On \(3\)-uniform hypergraphs avoiding a cycle of length four
- On the Turán number of the blow-up of the hexagon
- Triangles in graphs without bipartite suspensions
- On even-cycle-free subgraphs of the doubled Johnson graphs
- On optimization problems for graphs and security of digital communications
- A simple proof for the lower bound of the girth of graphs \(D(n,q)\)
- Balanced supersaturation for some degenerate hypergraphs
- How to build a pillar: a proof of Thomassen's conjecture
- The Ramsey number of a long even cycle versus a star
- On the additive complexity of some integer sequences
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- Almost all graphs with high girth and suitable density have high chromatic number
- Graph pattern detection: hardness for all induced patterns and faster noninduced cycles
- Turán‐type problems for long cycles in random and pseudo‐random graphs
- On the Constructor-Blocker game
- A polynomial resultant approach to algebraic constructions of extremal graphs
- Minimum degree conditions for monochromatic cycle partitioning
- Geometric graphs with no self-intersecting path of length three
- On the Turán number of some ordered even cycles
- On an extremal hypergraph problem related to combinatorial batch codes
- Pancyclicity of hamiltonian line graphs
- On product representation of powers. I
- On a conjecture of Erdős and Simonovits: even cycles
- On the Turán number of forests
- The number of \(C_{2\ell}\)-free graphs
- On the Turán number of theta graphs
This page was built for publication: Cycles of even length in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844243)