Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 1278901

Unavoidable patterns in locally balanced colourings


Kamčev, Nina; Müyesser, Alp
Unavoidable patterns in locally balanced colourings // Combinatorics probability & computing, 2 (2023), 1-13 doi:10.1017/s0963548323000160 (međunarodna recenzija, članak, znanstveni)


CROSBI ID: 1278901 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
Unavoidable patterns in locally balanced colourings

Autori
Kamčev, Nina ; Müyesser, Alp

Izvornik
Combinatorics probability & computing (0963-5483) 2 (2023); 1-13

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
Ramsey, blow-up, dependent random choice
(Ramsey, blow-up, dependent random choiceWhich patterns must a two-colouring of Kn contain if each vertex has at least εn red and εn blue neighbours? In this paper, we investigate this question and its multicolour variant. For instance, we show that any such graph contains a t-blow-up of an \textit{; ; alternating 4-cycle}; ; with t=Ω(logn).)

Sažetak
Which patterns must a two-colouring of Kn contain if each vertex has at least εn red and εn blue neighbours? In this paper, we investigate this question and its multicolour variant. For instance, we show that any such graph contains a t-blow-up of an alternating 4-cycle with t=Ω(logn).

Izvorni jezik
Engleski

Znanstvena područja
Matematika



POVEZANOST RADA


Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb,
Prirodoslovno-matematički fakultet, Zagreb

Profili:

Avatar Url Nina Kamčev (autor)

Poveznice na cjeloviti tekst rada:

doi arxiv.org www.cambridge.org

Citiraj ovu publikaciju:

Kamčev, Nina; Müyesser, Alp
Unavoidable patterns in locally balanced colourings // Combinatorics probability & computing, 2 (2023), 1-13 doi:10.1017/s0963548323000160 (međunarodna recenzija, članak, znanstveni)
Kamčev, N. & Müyesser, A. (2023) Unavoidable patterns in locally balanced colourings. Combinatorics probability & computing, 2, 1-13 doi:10.1017/s0963548323000160.
@article{article, author = {Kam\v{c}ev, Nina and M\"{u}yesser, Alp}, year = {2023}, pages = {1-13}, DOI = {10.1017/s0963548323000160}, keywords = {Ramsey, blow-up, dependent random choice}, journal = {Combinatorics probability and computing}, doi = {10.1017/s0963548323000160}, volume = {2}, issn = {0963-5483}, title = {Unavoidable patterns in locally balanced colourings}, keyword = {Ramsey, blow-up, dependent random choice} }
@article{article, author = {Kam\v{c}ev, Nina and M\"{u}yesser, Alp}, year = {2023}, pages = {1-13}, DOI = {10.1017/s0963548323000160}, keywords = {Ramsey, blow-up, dependent random choiceWhich patterns must a two-colouring of Kn contain if each vertex has at least εn red and εn blue neighbours? In this paper, we investigate this question and its multicolour variant. For instance, we show that any such graph contains a t-blow-up of an \textit{, , alternating 4-cycle}, , with t=Ω(logn).}, journal = {Combinatorics probability and computing}, doi = {10.1017/s0963548323000160}, volume = {2}, issn = {0963-5483}, title = {Unavoidable patterns in locally balanced colourings}, keyword = {Ramsey, blow-up, dependent random choiceWhich patterns must a two-colouring of Kn contain if each vertex has at least εn red and εn blue neighbours? In this paper, we investigate this question and its multicolour variant. For instance, we show that any such graph contains a t-blow-up of an \textit{, , alternating 4-cycle}, , with t=Ω(logn).} }

Časopis indeksira:


  • Current Contents Connect (CCC)
  • Web of Science Core Collection (WoSCC)
    • Science Citation Index Expanded (SCI-EXP)
    • SCI-EXP, SSCI i/ili A&HCI
  • Scopus


Citati:





    Contrast
    Increase Font
    Decrease Font
    Dyslexic Font