RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor
Subscription
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Uspekhi Mat. Nauk:
Year:
Volume:
Issue:
Page:
Find






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


Uspekhi Mat. Nauk, 1974, Volume 29, Issue 6(180), Pages 89–154 (Mi umn4449)  

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

Hypergraphs

A. A. Zykov


Full text: PDF file (3840 kB)
References: PDF file   HTML file

English version:
Russian Mathematical Surveys, 1974, 29:6, 89–156

Bibliographic databases:

MSC: 05C65, 05C15, 05C50

Citation: A. A. Zykov, “Hypergraphs”, Uspekhi Mat. Nauk, 29:6(180) (1974), 89–154; Russian Math. Surveys, 29:6 (1974), 89–156

Citation in format AMSBIB
\Bibitem{Zyk74}
\by A.~A.~Zykov
\paper Hypergraphs
\jour Uspekhi Mat. Nauk
\yr 1974
\vol 29
\issue 6(180)
\pages 89--154
\mathnet{http://mi.mathnet.ru/umn4449}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=401556}
\zmath{https://zbmath.org/?q=an:0307.05134|0311.05136}
\transl
\jour Russian Math. Surveys
\yr 1974
\vol 29
\issue 6
\pages 89--156
\crossref{https://doi.org/10.1070/RM1974v029n06ABEH001303}


Linking options:
  • http://mi.mathnet.ru/eng/umn4449
  • http://mi.mathnet.ru/eng/umn/v29/i6/p89

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. K.S Sarkaria, “Heawood inequalities”, Journal of Combinatorial Theory, Series A, 46:1 (1987), 50  crossref
    2. A. V. Shapovalov, “The distributions of the numbers of finite subgraphs in random nonhomogeneous hypergraphs”, Discrete Math. Appl., 16:4 (2006), 371–383  mathnet  crossref  crossref  mathscinet  zmath  elib
    3. V. V. Lepin, “Polinomialnyi algoritm proverki $2$-khromatichnosti rekursivno-porozhdaemykh $k$-terminalnykh gipergrafov”, Tr. In-ta matem., 14:2 (2006), 80–85  mathnet
    4. A. V. Shapovalov, “The cycle structure of a random nonhomogeneous hypergraph on the subcritical stage of evolution”, Discrete Math. Appl., 17:5 (2007), 475–493  mathnet  crossref  crossref  mathscinet  zmath  elib
    5. J. Appl. Industr. Math., 3:1 (2009), 144–147  mathnet  crossref  mathscinet  zmath  elib
    6. A. V. Shapovalov, “Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns”, Discrete Math. Appl., 18:4 (2008), 351–362  mathnet  crossref  crossref  mathscinet  zmath  elib
    7. E. V. Khvorostukhina, “On concrete characterization of universal hypergraphic automata”, J. Math. Sci., 164:2 (2010), 303–308  mathnet  crossref  mathscinet  elib
    8. E. V. Khvorostukhina, “O gomomorfizmakh polugrupp endomorfizmov gipergrafov”, Izv. Sarat. un-ta. Nov. ser. Ser. Matematika. Mekhanika. Informatika, 9:3 (2009), 70–75  mathnet
    9. Bykova V.V., “Polinomialnye dostatochnye usloviya realizuemosti gipergrafa na ploskosti”, Izv. Tomskogo politekh. un-ta, 314:2 (2009), 15–20  elib
    10. Cataranciuc Sergiu, Soltan Petru, “Abstract complexes, their homologies and applications”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2010, no. 2, 31–58  mathnet  mathscinet  zmath
    11. S. L. Blyumin, “Orgipergrafy: matrichnye predstavleniya”, UBS, 30.1 (2010), 22–39  mathnet  elib
    12. A. M. Raigorodskii, D. A. Shabanov, “The Erdős–Hajnal problem of hypergraph colouring, its generalizations, and related problems”, Russian Math. Surveys, 66:5 (2011), 933–1002  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
    13. A. S. Geida, “Modelirovanie pri issledovanii tekhnicheskikh sistem: ispolzovanie nekotorykh rasshirenii teorii grafov”, Tr. SPIIRAN, 17 (2011), 234–245  mathnet
    14. A. V. Mokryakov, V. I. Tsurkov, “Reconstructing 2-complexes by a nonnegative integer-valued vector”, Autom. Remote Control, 72:12 (2011), 2541–2552  mathnet  crossref  mathscinet  zmath  isi
    15. A. V. Shapovalov, “Sovmestnost sluchainykh sistem uravnenii s neravnoveroyatnoi vyborkoi dvuznachnykh neizvestnykh”, Matem. vopr. kriptogr., 2:4 (2011), 109–146  mathnet  crossref
    16. Bykova V.V., “Rekurrentnye metody vychisleniya drevovidnoi shiriny gipergrafa”, Izvestiya tomskogo politekhnicheskogo universiteta, 318:5 (2011), 5–10  elib
    17. Bozhko A.N., “Modelirovanie mekhanicheskikh svyazei izdeliya”, Nauka i obrazovanie: elektronnoe nauchno-tekhnicheskoe izdanie, 2011, no. 03, 9–9  elib
    18. Blyumin S.L., “Multiagentnye sistemy: gruppovye vzaimodeistviya agentov, vzveshennye orientirovannye gipergrafy”, Sistemy upravleniya i informatsionnye tekhnologii, 44:2 (2011), 49–53  elib
    19. Bykova V.V., “Algoritm postroeniya dereva dekompozitsii gipergrafa na osnove atsiklichnosti”, Programmnye produkty i sistemy, 2011, no. 1, 17–17  elib
    20. Geida A.S., “Modelirovanie pri issledovanii tekhnicheskikh sistem: ispolzovanie nekotorykh rasshirenii teorii grafov”, Trudy SPIIRAN, 2011, no. 17, 234–234  elib
    21. Khvorostukhina E.V., “Ob otnositelno elementarnoi opredelimosti klassa gipergraficheskikh avtomatov v klasse polugrupp”, Nauka i obschestvo, 2011, no. 1, 42–46  elib
    22. Mokryakov A.V., “Predstavlenie gipergrafov v vide algebraicheskoi struktury”, Izvestiya rossiiskoi akademii nauk. teoriya i sistemy upravleniya, 2011, no. 5, 53–59  elib
    23. Valentina V. Bykova, “O razlozhenii gipergrafa klikovymi minimalnymi separatorami”, Zhurn. SFU. Ser. Matem. i fiz., 5:1 (2012), 36–45  mathnet
    24. Tarasov V.A., Kruglov P.V., Bolotina I.A., “77-30569/339658 metod formirovaniya sovokupnosti dopustimykh variantov sborki izdelii na osnove primeneniya orientirovannykh gipergrafov”, Nauka i obrazovanie: elektronnoe nauchno-tekhnicheskoe izdanie, 2012, no. 02, 4–4  elib
    25. Raigorodskii A.M., “Predislovie redaktora nomera”, Trudy Moskovskogo fiziko-tekhnicheskogo instituta, 4:1-13 (2012), 4–11  elib
    26. Paolo Bottoni, Andrew Fish, Francesco Parisi Presicce, “Spider Graphs: a graph transformation system for spider diagrams”, Softw Syst Model, 2013  crossref
    27. E. A. Bondar, Yu. V. Zhuchok, “Representations of the strong endomorphism monoid of finite $n$-uniform hypergraphs”, J. Math. Sci., 201:4 (2014), 421–430  mathnet  crossref  mathscinet
    28. Yuriy V. Zhuchok, “The monoid of endomorphisms of disconnected hypergraphs”, Algebra Discrete Math., 16:1 (2013), 134–150  mathnet  mathscinet
    29. Maxim N. Nazarov, “Finite representation of classes of isomorphic groupoids”, Zhurn. SFU. Ser. Matem. i fiz., 8:3 (2015), 312–319  mathnet  crossref
    30. M. N. Nazarov, “Ob alternativnom sposobe zadaniya konechnykh grafov”, PDM, 2015, no. 3(29), 83–94  mathnet  crossref
    31. Peter Dankelmann, Dirk Meierling, “Maximally edge-connected hypergraphs”, Discrete Mathematics, 339:1 (2016), 33  crossref
  • Успехи математических наук Russian Mathematical Surveys
    Number of views:
    This page:1701
    Full text:790
    References:162
    First page:2

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019