Polarities and 2k-cycle-free graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 431444 (Why is no real title available?)
- scientific article; zbMATH DE number 3841900 (Why is no real title available?)
- scientific article; zbMATH DE number 4030354 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 22908 (Why is no real title available?)
- scientific article; zbMATH DE number 493032 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3392741 (Why is no real title available?)
- scientific article; zbMATH DE number 3421040 (Why is no real title available?)
- A characterization of the components of the graphs \(D(k,q)\)
- A new series of dense graphs of high girth
- Compactness results in extremal graph theory
- Cycles of even length in graphs
- Embeddings of small generalized polygons
- Explicit construction of graphs with an arbitrary large girth and of large size
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Graphs without four-cycles
- Graphs without quadrilaterals
- Minimal Regular Graphs of Girths Eight and Twelve
- New examples of graphs without small cycles and of large size
- On Graphs that do not Contain a Thomsen Graph
- On a class of degenerate extremal graph problems
- On the varieties of parabolic subgroups, their generalizations and combinatorial applications
- Properties of certain families of \(2k\)-cycle-free graphs
- Sur la trialité et certains groupes qui s'en déduisent
- The finite Moufang hexagons coordinatized
- The nonexistence of certain generalized polygons
Cited in
(31)- Graphs without theta subgraphs
- Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras
- Generalized Turán problems for even cycles
- Keyed hash function from large girth expander graphs
- A sequence of triangle-free pseudorandom graphs
- Clumsy packings of graphs
- On a conjecture of Erdős and Simonovits: even cycles
- Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs
- Minimal obstructions to \(( \infty , k )\)-polarity in cographs
- General properties of some families of graphs defined by systems of equations
- Improved upper bounds on even-cycle creating Hamilton paths
- On new examples of families of multivariate stable maps and their cryptographical applications
- Covering point-sets with parallel hyperplanes and sparse signal recovery
- Extremal numbers of hypergraph suspensions of even cycles
- Extremal edge polytopes
- On the Polarity and Monopolarity of Graphs
- Existence of spanning \(\mathcal{F}\)-free subgraphs with large minimum degree
- Some constructive bounds on Ramsey numbers
- Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
- Achromatic colorings of polarity graphs
- A note on pseudorandom Ramsey graphs
- Multi-color Ramsey numbers of even cycles
- New Upper Bound on Vertex Folkman Numbers
- An almost quadratic bound on vertex Folkman numbers
- scientific article; zbMATH DE number 6605190 (Why is no real title available?)
- On the girth of the bipartite graph \(D(k, q)\)
- Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\)
- Generalized Turán problems for even cycles
- On the Turán number for the hexagon
- On optimization problems for graphs and security of digital communications
- A note on the Turán function of even cycles
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)
