Results 71 to 80 of about 4,692 (164)

Embedding large subgraphs into dense graphs

, 2009
What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect matchings are generalized by
Kühn, Daniela, Osthus, Deryk
core   +1 more source

Ramsey expansions of metrically homogeneous graphs

, 2017
We discuss the Ramsey property, the existence of a stationary independence relation and the coherent extension property for partial isometries (coherent EPPA) for all classes of metrically homogeneous graphs from Cherlin's catalogue, which is conjectured
Aranda, Andrés, Bradley-Williams, David, Hubička, Jan, Karamanlis, Miltiadis, Kompatscher, Michael, Konečný, Matěj, Pawliuk, Micheal   +6 more
core  

On the Ramsey Numbers for Bipartite Multigraphs

, 2003
A coloring of a complete bipartite graph is shuffle-preserved if it is the case that assigning a color $c$ to edges $(u, v)$ and $(u', v')$ enforces the same color assignment for edges $(u, v')$ and $(u',v)$. (In words, the induced subgraph with respect to color $c$ is complete.) In this paper, we investigate a variant of the Ramsey problem for the ...
Chen, Ming-Yang, Lu, Hsueh-I., Yen, Hsu-Chun   +2 more
openaire   +2 more sources

The Bipartite Ramsey Numbers B(C2M; C2N)

, 2013
{"references": ["L. W. Beineke and A. J. Schwenk. On a bipartite form of the Ramsey\nproblem. Proc. 5th British Combin. Conf. 1975, Congressus Number.,\nXV: 17-22, 1975.", "W. A. Carnielli and E. L. Monte Carmelo. K2,2 \u2212 K1,n and K2,n \u2212 K2,n bipartite Ramsey numbers. Discrete Math., 223: 83-92, 2000.", "R. J. Faudree and R. H. Schelp.
Zhang, Rui, Yongqi Sun, And Yali Wu
openaire   +1 more source

Mono-multi bipartite Ramsey numbers, designs, and matrices

Journal of Combinatorial Theory, Series A, 2006
The mono-multi bipartite Ramsey number BRR\((G_1,G_2)\) is the smallest \(N\) such that any edge coloring of the complete bipartite graph \(K_{N,N}\) contains either a monochromatic \(G_1\) or a multicolored \(G_2\). The problem of finding the values of BRR\((G_1,G_2)\) is reformulated in terms of matrices for the case that \(G_1\) is a star and \(G_2\)
Balister, Paul N., Gyárfás, András, Lehel, Jenoő, Schelp, Richard H.   +3 more
openaire   +2 more sources

Some results on the multipartite Ramsey numbers m _j (C ₃,C _m ,n ₁ K ₂,n ₂ K ₂,…,n _i K ₂). [PDF]

Heliyon, 2022
Rowshan Y, Gholami M, Shateyi S.
europepmc   +1 more source

Ramsey numbers and the size of graphs

, 2007
For two graph H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every red-blue edge coloring of the complete graph K_n on n vertices contains either a red copy of H or a blue copy of G.
Sudakov, Benny
core   +2 more sources

Odd-Ramsey numbers of complete bipartite graphs

European Journal of Combinatorics
15 ...
Boyadzhiyska, Simona, Das, Shagnik, Lesgourgues, Thomas, Petrova, Kalina   +3 more
openaire   +2 more sources

Integrating High throughput Sequencing into Survey Design Reveals Turnip Yellows Virus and Soybean Dwarf Virus in Pea (<i>Pisum Sativum</i>) in the United Kingdom. [PDF]

Viruses, 2021
Fowkes AR, McGreig S, Pufal H, Duffy S, Howard B, Adams IP, Macarthur R, Weekes R, Fox A.   +8 more
europepmc   +1 more source

Information theory: A foundation for complexity science. [PDF]

Proc Natl Acad Sci U S A, 2022
Golan A, Harte J.
europepmc   +1 more source