Saturated Graphs of Prescribed Minimum Degree

DOI10.1017/S0963548316000377zbMath1371.05140arXiv1407.6664OpenAlexW3099120672MaRDI QIDQ5366942

A. Nicholas Day

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.6664

zbMATH Keywords

graphs construction

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (5)

On the size of \((K_t, K_{1, k})\)-co-critical graphs ⋮ On the size of \((K_t, P_k)\)-co-critical graphs ⋮ On the size of \((K_t,\mathcal{T}_k)\)-co-critical graphs ⋮ Regular saturated graphs and sum-free sets ⋮ Saturation numbers for Ramsey-minimal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of minimum saturated graphs
• Logarithmic order of free distributive lattice
• Minimalk-saturated and color critical graphs of prescribed minimum degree
• Maximal triangle‐free graphs with restrictions on the degrees
• On maximal triangle‐free graphs
• Onk-saturated graphs with restrictions on the degrees
• A Problem in Graph Theory
• A Theorem on k-Saturated Graphs
• On generalized graphs
• A short proof of Sperner's lemma
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set

This page was built for publication: Saturated Graphs of Prescribed Minimum Degree