|
Ramsey-Tur?n type results for matchings in edge colored graphs
|
10.1016/j.disc.2023.113785 |
1402 - 12 |
|
LARGE STARS WITH FEW COLORS
|
# |
1401 - 04 |
|
RAMSEY PROBLEMS FOR BERGE HYPERGRAPHS
|
# |
1399 - 07 |
|
A proof of a conjecture of Gyarfas, Lehel, Sarkozy and Schelp on Berge-cycles
|
# |
1399 - 01 |
|
Size Ramsey numbers of stars versus cliques
|
# |
1398 - 09 |
|
On the Size-Ramsey Number of Cycles
|
10.1017/S0963548319000221 |
1398 - 08 |
|
Directed strongly walk-regular graphs
|
# |
1397 - 06 |
|
On a Question of Erdos and Faudree on the Size Ramsey Numbers
|
10.1137/17M1115022 |
1397 - 04 |
|
Stars versus stripes Ramsey numbers
|
# |
1396 - 10 |
|
Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles
|
10.1002/jgt.22226 |
1396 - 09 |
|
Minimum cuts of distance0regular digraphs
|
# |
1396 - 06 |
|
Ramsey numbers of 4-uniform loose cycles
|
# |
1396 - 04 |
|
DIAGONAL RAMSEY NUMBERS OF LOOSE CYCLES IN UNIFORM HYPERGRAPHS
|
# |
1396 - 04 |
|
A generalization of Ramsey theory for stars and one matching
|
# |
1395 - 10 |
|
Ramsey numbers of uniform loose paths and cycles
|
# |
1395 - 10 |
|
Monochromatic Hamiltonian Berge-cycles in colored hypergraphs
|
# |
1395 - 10 |
|
On group choosability of graphs I
|
# |
1395 - 04 |
|
A spectral excess theorem for normal digraphs
|
# |
1393 - 12 |
|
On three-color Ramsey number of paths
|
# |
1393 - 10 |
|
Decomposing hypergraphs into k -colorable hypergraphs
|
# |
1393 - 03 |