Matches in SemOpenAlex for { <https://semopenalex.org/work/W4285662748> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W4285662748 abstract "Burr and ErdH{o}s in 1975 conjectured, and Chv'atal, Rodl, Szemer'edi and Trotter later proved, that the Ramsey number of any bounded degree graph is linear in the number of vertices. In this paper, we disprove the natural directed analogue of the Burr--ErdH{o}s conjecture, answering a question of Buci'c, Letzter, and Sudakov. If $H$ is an acyclic digraph, the oriented Ramsey number of $H$, denoted $overrightarrow{r_{1}}(H)$, is the least $N$ such that every tournament on $N$ vertices contains a copy of $H$. We show that for any $Delta geq 2$ and any sufficiently large $n$, there exists an acyclic digraph $H$ with $n$ vertices and maximum degree $Delta$ such that [ overrightarrow{r_{1}}(H)ge n^{Omega(Delta^{2/3}/ log^{5/3} Delta)}. ] This proves that $overrightarrow{r_{1}}(H)$ is not always linear in the number of vertices for bounded-degree $H$. On the other hand, we show that $overrightarrow{r_{1}}(H)$ is nearly linear in the number of vertices for typical bounded-degree acyclic digraphs $H$, and obtain linear or nearly linear bounds for several natural families of bounded-degree acyclic digraphs. For multiple colors, we prove a quasi-polynomial upper bound $overrightarrow{r_{k}}(H)=2^{(log n)^{O_{k}(1)}}$ for all bounded-degree acyclic digraphs $H$ on $n$ vertices, where $overrightarrow{r_k}(H)$ is the least $N$ such that every $k$-edge-colored tournament on $N$ vertices contains a monochromatic copy of $H$. For $kgeq 2$ and $ngeq 4$, we exhibit an acyclic digraph $H$ with $n$ vertices and maximum degree $3$ such that $overrightarrow{r_{k}}(H)ge n^{Omega(log n/loglog n)}$, showing that these Ramsey numbers can grow faster than any polynomial in the number of vertices." @default.
- W4285662748 created "2022-07-17" @default.
- W4285662748 creator A5006789469 @default.
- W4285662748 creator A5042083332 @default.
- W4285662748 creator A5075195356 @default.
- W4285662748 date "2021-05-05" @default.
- W4285662748 modified "2023-09-27" @default.
- W4285662748 title "Ramsey numbers of sparse digraphs" @default.
- W4285662748 doi "https://doi.org/10.48550/arxiv.2105.02383" @default.
- W4285662748 hasPublicationYear "2021" @default.
- W4285662748 type Work @default.
- W4285662748 citedByCount "0" @default.
- W4285662748 crossrefType "posted-content" @default.
- W4285662748 hasAuthorship W4285662748A5006789469 @default.
- W4285662748 hasAuthorship W4285662748A5042083332 @default.
- W4285662748 hasAuthorship W4285662748A5075195356 @default.
- W4285662748 hasBestOaLocation W42856627481 @default.
- W4285662748 hasConcept C114614502 @default.
- W4285662748 hasConcept C118615104 @default.
- W4285662748 hasConcept C121332964 @default.
- W4285662748 hasConcept C132525143 @default.
- W4285662748 hasConcept C134306372 @default.
- W4285662748 hasConcept C136975688 @default.
- W4285662748 hasConcept C184264201 @default.
- W4285662748 hasConcept C24890656 @default.
- W4285662748 hasConcept C2775997480 @default.
- W4285662748 hasConcept C2779145032 @default.
- W4285662748 hasConcept C2779557605 @default.
- W4285662748 hasConcept C2780990831 @default.
- W4285662748 hasConcept C33923547 @default.
- W4285662748 hasConcept C34388435 @default.
- W4285662748 hasConcept C44115641 @default.
- W4285662748 hasConcept C62520636 @default.
- W4285662748 hasConcept C77553402 @default.
- W4285662748 hasConceptScore W4285662748C114614502 @default.
- W4285662748 hasConceptScore W4285662748C118615104 @default.
- W4285662748 hasConceptScore W4285662748C121332964 @default.
- W4285662748 hasConceptScore W4285662748C132525143 @default.
- W4285662748 hasConceptScore W4285662748C134306372 @default.
- W4285662748 hasConceptScore W4285662748C136975688 @default.
- W4285662748 hasConceptScore W4285662748C184264201 @default.
- W4285662748 hasConceptScore W4285662748C24890656 @default.
- W4285662748 hasConceptScore W4285662748C2775997480 @default.
- W4285662748 hasConceptScore W4285662748C2779145032 @default.
- W4285662748 hasConceptScore W4285662748C2779557605 @default.
- W4285662748 hasConceptScore W4285662748C2780990831 @default.
- W4285662748 hasConceptScore W4285662748C33923547 @default.
- W4285662748 hasConceptScore W4285662748C34388435 @default.
- W4285662748 hasConceptScore W4285662748C44115641 @default.
- W4285662748 hasConceptScore W4285662748C62520636 @default.
- W4285662748 hasConceptScore W4285662748C77553402 @default.
- W4285662748 hasLocation W42856627481 @default.
- W4285662748 hasOpenAccess W4285662748 @default.
- W4285662748 hasPrimaryLocation W42856627481 @default.
- W4285662748 hasRelatedWork W153926374 @default.
- W4285662748 hasRelatedWork W1975414774 @default.
- W4285662748 hasRelatedWork W1982223060 @default.
- W4285662748 hasRelatedWork W2621158780 @default.
- W4285662748 hasRelatedWork W2624013591 @default.
- W4285662748 hasRelatedWork W2741622030 @default.
- W4285662748 hasRelatedWork W3157407812 @default.
- W4285662748 hasRelatedWork W4298038380 @default.
- W4285662748 hasRelatedWork W4301642734 @default.
- W4285662748 hasRelatedWork W755952011 @default.
- W4285662748 isParatext "false" @default.
- W4285662748 isRetracted "false" @default.
- W4285662748 workType "article" @default.