Generalized split graphs and Ramsey numbers
DOI10.1006/JCTA.1997.2833zbMATH Open0893.05012OpenAlexW2060765296MaRDI QIDQ1380352FDOQ1380352
Authors: 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
Recommendations
- Generalized Ramsey Numbers Involving Subdivision Graphs, And Related Problems in Graph Theory
- Ramsey linear families and generalized subdivided graphs
- Generalized Ramsey theory and decomposable properties of graphs
- On generalized split graphs
- scientific article; zbMATH DE number 2187702
- scientific article; zbMATH DE number 3885958
- Anti-Ramsey numbers in complete split graphs
- On generalized Ramsey numbers
- scientific article; zbMATH DE number 3494449
- Ramsey multiplicities of some graphs
Ramsey numberssplit graphs[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=theorem+of+Erd%EF%BF%BD%EF%BF%BDs+and+Rado&go=Go theorem of Erd��s and Rado]
Cites Work
Cited In (13)
- Partitioning permutations into monotone subsequences
- On subgraph complementation to \(H\)-free graphs
- Satgraphs and independent domination. I
- Bipartite bihypergraphs: a survey and new results
- Generalized Ramsey theory and decomposable properties of graphs
- Extending the Gyárfás-Sumner conjecture
- A finite basis characterization of alpha-split colorings
- Recognition of split-graphic sequences
- On splittable colorings of graphs and hypergraphs
- Algorithms for subgraph complementation to some classes of graphs
- On subgraph complementation to \(H\)-free Graphs
- Ramsey numbers and graph parameters
- The \(k\)-hop connected dominating set problem: approximation and hardness
This page was built for publication: Generalized split graphs and Ramsey numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380352)
