Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretnaya Matematika, 2015, Volume 27, Issue 2, Pages 112–133
DOI: https://doi.org/10.4213/dm1329
(Mi dm1329)
 

This article is cited in 2 scientific papers (total in 2 papers)

On regular hypergraphs with high girth and high chromatic number

A. E. Khuzievaa, D. A. Shabanovb

a Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
b Lomonosov Moscow State University
Full-text PDF (525 kB) Citations (2)
References:
Abstract: The paper is concerned with an extremal problem of combinatorial analysis on finding the minimal possible number of edges in an $n$-regular hypergraph with chromatic number greater than $r$ and girth greater than $s$. A new lower estimate of this extremal value is obtained and a number of related results is proved.
Keywords: hypergraph, colouring of hypergraphs, sparse hypergraphs, random recolouring method, girth of a hypergraph.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation НШ-2964.2014.1
MK-692.2014.1
Received: 06.04.2015
English version:
Discrete Mathematics and Applications, 2015, Volume 25, Issue 5, Pages 277–294
DOI: https://doi.org/10.1515/dma-2015-0027
Bibliographic databases:
Document Type: Article
UDC: 519.112.7, 519.179.1, 519.179.4
Language: Russian
Citation: A. E. Khuzieva, D. A. Shabanov, “On regular hypergraphs with high girth and high chromatic number”, Diskr. Mat., 27:2 (2015), 112–133; Discrete Math. Appl., 25:5 (2015), 277–294
Citation in format AMSBIB
\Bibitem{KhuSha15}
\by A.~E.~Khuzieva, D.~A.~Shabanov
\paper On regular hypergraphs with high girth and high chromatic number
\jour Diskr. Mat.
\yr 2015
\vol 27
\issue 2
\pages 112--133
\mathnet{http://mi.mathnet.ru/dm1329}
\crossref{https://doi.org/10.4213/dm1329}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3468395}
\elib{https://elibrary.ru/item.asp?id=24073697}
\transl
\jour Discrete Math. Appl.
\yr 2015
\vol 25
\issue 5
\pages 277--294
\crossref{https://doi.org/10.1515/dma-2015-0027}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000366855300003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84949989398}
Linking options:
  • https://www.mathnet.ru/eng/dm1329
  • https://doi.org/10.4213/dm1329
  • https://www.mathnet.ru/eng/dm/v27/i2/p112
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:455
    Full-text PDF :176
    References:52
    First page:35
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025