Un problème extremal pour les graphes et les hypergraphes

DOI10.1016/0012-365X(75)90106-5zbMath0304.05128MaRDI QIDQ1216326

F. Sterboul

Publication date: 1975

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (5)

Equations for point configurations to Lie on a rational normal curve ⋮ Smallest set-transversals of \(k\)-partitions ⋮ An extremal problem in hypergraph coloring ⋮ Equipartite colorings in graphs and hypergraphs ⋮ A problem on triples

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pancyclic graphs. I
• A note on Hamiltonian circuits
• A smallest graph of girth 5 and valency 5
• Über ein Problem von K. Zarankiewicz
• On the Non-Existence of a Type of Regular Graphs of Girth 5

This page was built for publication: Un problème extremal pour les graphes et les hypergraphes