Generalized split graphs and Ramsey numbers

DOI10.1006/jcta.1997.2833zbMath0893.05012OpenAlexW2060765296MaRDI QIDQ1380352

András Gyárfás

Publication date: 4 March 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e525d7f6a4dd906f5af68e1ce404ac54689eb101

zbMATH Keywords

Ramsey numberssplit graphstheorem of Erdős and Rado

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (9)

Satgraphs and independent domination. I ⋮ Partitioning permutations into monotone subsequences ⋮ The \(k\)-hop connected dominating set problem: approximation and hardness ⋮ On subgraph complementation to \(H\)-free graphs ⋮ Extending the Gyárfás-Sumner conjecture ⋮ Recognition of split-graphic sequences ⋮ Bipartite bihypergraphs: a survey and new results ⋮ On subgraph complementation to \(H\)-free Graphs ⋮ On splittable colorings of graphs and hypergraphs

Cites Work

• Partitioning permutations into increasing and decreasing subsequences
• Intersection Theorems for Systems of Sets
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized split graphs and Ramsey numbers