Graphentheoretische Extremalprobleme

DOI10.1007/BF01897150zbMath0125.11802OpenAlexW4238956933MaRDI QIDQ5329579

B. Andrasfai

Publication date: 1964

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01897150

zbMATH Keywords

topology

Related Items

Singular Turán numbers and worm-colorings ⋮ Triangle-free graphs with the maximum number of cycles ⋮ Smith forms for adjacency matrices of circulant graphs ⋮ Cycle-maximal triangle-free graphs ⋮ Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\) ⋮ Regular Turán numbers of complete bipartite graphs ⋮ Regular Tur\'an numbers ⋮ Homomorphism thresholds for odd cycles ⋮ Graphs of odd girth 7 with large degree ⋮ On the connection between chromatic number, maximal clique and minimal degree of a graph

Cites Work

• Über ein Extremalproblem der Graphentheorie
• The Construction of Certain Graphs
• On the theory of graphs