scientific article; zbMATH DE number 426329

MaRDI QIDQ3137178zbMATH OpenFDO

Authors László A. Székely, D. de Caen

Publication date 11 September 1994

zbMATH Keywords

bipartite graphgeneralized quadranglesmaximum size

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized quadrangles and generalized polygons in finite geometry (51E12)

Recommendations

• Maximum bipartite subgraphs in graphs without short cycles
• Four-cycles in graphs without a given even cycle
• scientific article; zbMATH DE number 687701
• \(C_ 6\)-free bipartite graphs and product representation of squares
• Maximum cuts of graphs with forbidden cycles

Cited in

(10)

• scientific article; zbMATH DE number 6501194 (Why is no real title available?)
• Four-cycles in graphs without a given even cycle
• The number of \(K_{m,m}\)-free graphs
• On the Turán number for the hexagon
• \(C_ 6\)-free bipartite graphs and product representation of squares
• The number of cycle lengths in graphs of given minimum degree and girth
• Ranking hypotheses to minimize the search cost in probabilistic inference models
• A unified framework for light spanners
• scientific article; zbMATH DE number 687701 (Why is no real title available?)
• On dense bipartite graphs of girth eigth and upper bounds for certain configurations in planar point-line systems

This page was built for publication:

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