İçeriğe geç
akaturk Akademik ölçüm

OpenAlex konusu

Limits and Structures in Graph Theory

Bu sayfa OpenAlex konu etiketine göre çalışmaları ve o konuda görünen akademisyenleri listeler. YÖKSİS temel alan / yan dal değildir.

OpenAlex 254 eser 18 yazar konusu

Çalışmalar

254 eser

  1. YÖKSİS SJR Q2 JCR Q3 OpenAlex üst %1 OpenAlex 99.6%

    Özet henüz yok.

  2. YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 97.4%

    We prove that $ \mathop{ \lim \inf}\limits_{n \rightarrow \infty} \frac{p_{n+1}-p_{n}}{\sqrt{\log p_{n}} \left(\log \log p_{n}\right)^{2}}< \infty, $where pn denotes the nth prime. Since on average pn+1−pn is asymptotically log n, this shows that we can always find pairs of primes much closer together than the average…

  3. YÖKSİS SJR Q1 JCR Q3 OpenAlex 78.4%

    Özet henüz yok.

  4. YÖKSİS SJR Q1 JCR Q3 OpenAlex üst %10 OpenAlex 93.4%

    Özet henüz yok.

  5. YÖKSİS SJR Q2 JCR Q3 OpenAlex 80.1%

    Özet henüz yok.

  6. OpenAlex 69.0%

    Özet henüz yok.

  7. YÖKSİS SJR Q1 JCR Q3 OpenAlex üst %10 OpenAlex 92.9%

    For weakly regular bent functions in odd characteristic the dual function is also bent.We analyse a recently introduced construction of non-weakly regular bent functions andshow conditions under which their dual is bent as well. This leads to the definition ofthe class of dual-bent functions containing the class of we…

  8. OpenAlex üst %10 OpenAlex 97.3%

    The enumeration of independent sets in graphs with various restrictions has been a topic of much interest of late. Let $i(G)$ be the number of independent sets in a graph $G$ and let $i_t(G)$ be the number of independent sets in $G$ of size $t$. Kahn used entropy to show that if $G$ is an $r$-regular bipartite graph w…

  9. YÖKSİS SJR Q1 JCR Q2 OpenAlex 87.7%

    Bent functions can be classified into regular bent functions, weakly regular but not regular bent functions, and non-weakly regular bent functions. Regular and weakly regular bent functions always appear in pairs, since their duals are also bent functions. In general, this does not apply to non-weakly regular bent fun…

  10. YÖKSİS SJR Q1 JCR Q4 OpenAlex 89.8%

    Özet henüz yok.

  11. OpenAlex 56.2%

    Özet henüz yok.

  12. YÖKSİS SJR Q1 JCR Q2 OpenAlex 86.7%

    It is shown that the size of a subgraph of Q n without a cycle of length 14 is of order o (| E ( Q n )|).

Akademisyenler

18 akademisyen