Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Felix Christian Clemen"'
Publikováno v:
Journal of Combinatorial Theory, Series B. 157:216-234
One of the major problems in combinatorics is to determine the number of $r$-uniform hypergraphs ($r$-graphs) on $n$ vertices which are free of certain forbidden structures. This problem dates back to the work of Erd\H{o}s, Kleitman and Rothschild, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::454e1696f907a50259402232589fede4
https://doi.org/10.1016/j.jctb.2022.07.001
https://doi.org/10.1016/j.jctb.2022.07.001
Autor:
József Balogh, Felix Christian Clemen
Publikováno v:
Illinois Journal of Mathematics. 67
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8188be5fa93cd92cd3929d9b4b97ac7
https://doi.org/10.1215/00192082-10429321
https://doi.org/10.1215/00192082-10429321
Publikováno v:
Journal of the London Mathematical Society. 106:60-84
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f492519caf296f9db1765f3e79650f5f
https://doi.org/10.1112/jlms.12568
https://doi.org/10.1112/jlms.12568
Publikováno v:
Discrete Applied Mathematics
A graph where each vertex $v$ has a list $L(v)$ of available colors is $L$-colorable if there is a proper coloring such that the color of $v$ is in $L(v)$ for each $v$. A graph is $k$-choosable if every assignment $L$ of at least $k$ colors to each v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1819064187755327c90bfafe0662fb5
https://doi.org/10.1016/j.dam.2021.09.021
https://doi.org/10.1016/j.dam.2021.09.021
Publikováno v:
Combinatorics, Probability and Computing. 30:609-618
The Erd\H{o}s-Simonovits stability theorem states that for all \epsilon >0 there exists \alpha >0 such that if G is a K_{r+1}-free graph on n vertices with e(G) > ex(n,K_{r+1}) - \alpha n^2, then one can remove \epsilon n^2 edges from G to obtain an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::603dcb448d0d935de9e25e8288ac09fa
https://doi.org/10.1017/s0963548320000590
https://doi.org/10.1017/s0963548320000590
Publikováno v:
Discrete Applied Mathematics. 276:13-18
An ordered graph is a simple graph with an ordering on its vertices. Define the ordered path P n to be the monotone increasing path with n edges. The ordered size Ramsey number r ( P r , P s ) is the minimum number m for which there exists an ordered
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fb1616c3741c05757f4ef04f92337d0
https://doi.org/10.1016/j.dam.2019.02.002
https://doi.org/10.1016/j.dam.2019.02.002
A triangle $T'$ is $\varepsilon$-similar to another triangle $T$ if their angles pairwise differ by at most $\varepsilon$. Given a triangle $T$, $\varepsilon>0$ and $n\in\mathbb{N}$, B\'ar\'any and F\"uredi asked to determine the maximum number of tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b084f28cd2b45f6ed6051ac837b8d63
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
A well-known conjecture by Erdős states that every triangle-free graph on n vertices can be made bipartite by removing at most \(n^2/25\) edges. This conjecture was known for graphs with edge density at least 0.4 and edge density at most 0.172. Here
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4952332542bbc150004694d7f3c5afd7
https://doi.org/10.1007/978-3-030-83823-2_82
https://doi.org/10.1007/978-3-030-83823-2_82
Publikováno v:
European Journal of Combinatorics. 101:103456
The Erdős–Szekeres Theorem stated in terms of graphs says that any red–blue coloring of the edges of the ordered complete graph K r s + 1 contains a red copy of the monotone increasing path with r edges or a blue copy of the monotone increasing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08f3daf58f5426ba37012a90626d69b9
https://doi.org/10.1016/j.ejc.2021.103456
https://doi.org/10.1016/j.ejc.2021.103456
Publikováno v:
The Electronic Journal of Combinatorics, 27 (1)
The Electronic Journal of Combinatorics, 27 (1)
ISSN:1097-1440
ISSN:1077-8926
ISSN:1097-1440
ISSN:1077-8926
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d812a2bdbd4b201362940b2ba173e6e