Polarities and 2k-cycle-free graphs

DOI10.1016/S0012-365X(99)90107-3zbMATH Open0924.05043OpenAlexW4210755957MaRDI QIDQ1292856FDOQ1292856

Authors: Andrew J. Woldar, Felix Lazebnik, V. A. Ustimenko 

Publication date: 3 November 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90107-3

Recommendations

• Properties of certain families of \(2k\)-cycle-free graphs
• A note on graphs without short even cycles
• Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
• Small dense subgraphs of polarity graphs and the extremal number for the 4-cycle

zbMATH Keywords

cyclesasymptotic lower boundpolaritiesminimum chromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites Work

• The nonexistence of certain generalized polygons
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Graphs that do not Contain a Thomsen Graph
• New examples of graphs without small cycles and of large size
• Cycles of even length in graphs
• Sur la trialité et certains groupes qui s'en déduisent
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• Properties of certain families of \(2k\)-cycle-free graphs
• Compactness results in extremal graph theory
• Title not available (Why is that?)
• Minimal Regular Graphs of Girths Eight and Twelve
• Explicit construction of graphs with an arbitrary large girth and of large size
• A characterization of the components of the graphs \(D(k,q)\)
• A new series of dense graphs of high girth
• Graphs without quadrilaterals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphs without four-cycles
• Title not available (Why is that?)
• Embeddings of small generalized polygons
• On a class of degenerate extremal graph problems
• Title not available (Why is that?)
• The finite Moufang hexagons coordinatized
• On the varieties of parabolic subgroups, their generalizations and combinatorial applications
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (31)

• Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs
• Improved upper bounds on even-cycle creating Hamilton paths
• An almost quadratic bound on vertex Folkman numbers
• Extremal edge polytopes
• Clumsy packings of graphs
• On a conjecture of Erdős and Simonovits: even cycles
• Title not available (Why is that?)
• Graphs without theta subgraphs
• On the girth of the bipartite graph \(D(k, q)\)
• Keyed hash function from large girth expander graphs
• On the Polarity and Monopolarity of Graphs
• Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras
• Achromatic colorings of polarity graphs
• Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\)
• Minimal obstructions to \(( \infty , k )\)-polarity in cographs
• On New Examples of Families of Multivariate Stable Maps and their Cryptographical Applications
• Generalized Turán problems for even cycles
• Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
• Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
• Multi-color Ramsey numbers of even cycles
• Generalized Turán problems for even cycles
• On the Turán number for the hexagon
• A note on the Turán function of even cycles
• Title not available (Why is that?)
• Some constructive bounds on Ramsey numbers
• Extremal numbers of hypergraph suspensions of even cycles
• A Sequence of Triangle-Free Pseudorandom Graphs
• New Upper Bound on Vertex Folkman Numbers
• Covering point-sets with parallel hyperplanes and sparse signal recovery
• General properties of some families of graphs defined by systems of equations
• A note on pseudorandom Ramsey graphs

This page was built for publication: Polarities and \(2k\)-cycle-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292856)