On regular hypergraphs with high girth and high chromatic number
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...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Alina E. Khuzieva [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: Discrete mathematics and applications - Berlin : de Gruyter, 1991, 25(2015), 5, Seite 277-294 |
|---|---|
| Übergeordnetes Werk: |
volume:25 ; year:2015 ; number:5 ; pages:277-294 |
| Links: |
|---|
| DOI / URN: |
10.1515/dma-2015-0027 |
|---|
| Katalog-ID: |
OLC1959007432 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1959007432 | ||
| 003 | DE-627 | ||
| 005 | 20220214200312.0 | ||
| 007 | tu | ||
| 008 | 160206s2015 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1515/dma-2015-0027 |2 doi | |
| 028 | 5 | 2 | |a PQ20160617 |
| 035 | |a (DE-627)OLC1959007432 | ||
| 035 | |a (DE-599)GBVOLC1959007432 | ||
| 035 | |a (PRQ)walterdegruyter_journals_10_1515_dma_2015_00272552770 | ||
| 035 | |a (KEY)0205755720150000025000500277onregularhypergraphswithhighgirthandhighchromaticn | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q DNB |
| 084 | |a 31.00 |2 bkl | ||
| 100 | 0 | |a Alina E. Khuzieva |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a On regular hypergraphs with high girth and high chromatic number |
| 264 | 1 | |c 2015 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a 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. | ||
| 650 | 4 | |a random recolouring method | |
| 650 | 4 | |a hypergraph | |
| 650 | 4 | |a girth of a hypergraph | |
| 650 | 4 | |a sparse hypergraphs | |
| 650 | 4 | |a colouring of hypergraphs | |
| 700 | 0 | |a Dmitriy A. Shabanov |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t Discrete mathematics and applications |d Berlin : de Gruyter, 1991 |g 25(2015), 5, Seite 277-294 |w (DE-627)131011243 |w (DE-600)1088921-8 |w (DE-576)033025673 |x 0924-9265 |7 nnns |
| 773 | 1 | 8 | |g volume:25 |g year:2015 |g number:5 |g pages:277-294 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1515/dma-2015-0027 |3 Volltext |
| 856 | 4 | 2 | |u http://www.degruyter.com/doi/10.1515/dma-2015-0027 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2088 | ||
| 912 | |a GBV_ILN_4277 | ||
| 936 | b | k | |a 31.00 |q AVZ |
| 951 | |a AR | ||
| 952 | |d 25 |j 2015 |e 5 |h 277-294 | ||
| author_variant |
a e k aek |
|---|---|
| matchkey_str |
article:09249265:2015----::neuahprrpsihihitadi |
| hierarchy_sort_str |
2015 |
| bklnumber |
31.00 |
| publishDate |
2015 |
| allfields |
10.1515/dma-2015-0027 doi PQ20160617 (DE-627)OLC1959007432 (DE-599)GBVOLC1959007432 (PRQ)walterdegruyter_journals_10_1515_dma_2015_00272552770 (KEY)0205755720150000025000500277onregularhypergraphswithhighgirthandhighchromaticn DE-627 ger DE-627 rakwb eng 510 DNB 31.00 bkl Alina E. Khuzieva verfasserin aut On regular hypergraphs with high girth and high chromatic number 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier 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. random recolouring method hypergraph girth of a hypergraph sparse hypergraphs colouring of hypergraphs Dmitriy A. Shabanov oth Enthalten in Discrete mathematics and applications Berlin : de Gruyter, 1991 25(2015), 5, Seite 277-294 (DE-627)131011243 (DE-600)1088921-8 (DE-576)033025673 0924-9265 nnns volume:25 year:2015 number:5 pages:277-294 http://dx.doi.org/10.1515/dma-2015-0027 Volltext http://www.degruyter.com/doi/10.1515/dma-2015-0027 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2088 GBV_ILN_4277 31.00 AVZ AR 25 2015 5 277-294 |
| spelling |
10.1515/dma-2015-0027 doi PQ20160617 (DE-627)OLC1959007432 (DE-599)GBVOLC1959007432 (PRQ)walterdegruyter_journals_10_1515_dma_2015_00272552770 (KEY)0205755720150000025000500277onregularhypergraphswithhighgirthandhighchromaticn DE-627 ger DE-627 rakwb eng 510 DNB 31.00 bkl Alina E. Khuzieva verfasserin aut On regular hypergraphs with high girth and high chromatic number 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier 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. random recolouring method hypergraph girth of a hypergraph sparse hypergraphs colouring of hypergraphs Dmitriy A. Shabanov oth Enthalten in Discrete mathematics and applications Berlin : de Gruyter, 1991 25(2015), 5, Seite 277-294 (DE-627)131011243 (DE-600)1088921-8 (DE-576)033025673 0924-9265 nnns volume:25 year:2015 number:5 pages:277-294 http://dx.doi.org/10.1515/dma-2015-0027 Volltext http://www.degruyter.com/doi/10.1515/dma-2015-0027 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2088 GBV_ILN_4277 31.00 AVZ AR 25 2015 5 277-294 |
| allfields_unstemmed |
10.1515/dma-2015-0027 doi PQ20160617 (DE-627)OLC1959007432 (DE-599)GBVOLC1959007432 (PRQ)walterdegruyter_journals_10_1515_dma_2015_00272552770 (KEY)0205755720150000025000500277onregularhypergraphswithhighgirthandhighchromaticn DE-627 ger DE-627 rakwb eng 510 DNB 31.00 bkl Alina E. Khuzieva verfasserin aut On regular hypergraphs with high girth and high chromatic number 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier 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. random recolouring method hypergraph girth of a hypergraph sparse hypergraphs colouring of hypergraphs Dmitriy A. Shabanov oth Enthalten in Discrete mathematics and applications Berlin : de Gruyter, 1991 25(2015), 5, Seite 277-294 (DE-627)131011243 (DE-600)1088921-8 (DE-576)033025673 0924-9265 nnns volume:25 year:2015 number:5 pages:277-294 http://dx.doi.org/10.1515/dma-2015-0027 Volltext http://www.degruyter.com/doi/10.1515/dma-2015-0027 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2088 GBV_ILN_4277 31.00 AVZ AR 25 2015 5 277-294 |
| allfieldsGer |
10.1515/dma-2015-0027 doi PQ20160617 (DE-627)OLC1959007432 (DE-599)GBVOLC1959007432 (PRQ)walterdegruyter_journals_10_1515_dma_2015_00272552770 (KEY)0205755720150000025000500277onregularhypergraphswithhighgirthandhighchromaticn DE-627 ger DE-627 rakwb eng 510 DNB 31.00 bkl Alina E. Khuzieva verfasserin aut On regular hypergraphs with high girth and high chromatic number 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier 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. random recolouring method hypergraph girth of a hypergraph sparse hypergraphs colouring of hypergraphs Dmitriy A. Shabanov oth Enthalten in Discrete mathematics and applications Berlin : de Gruyter, 1991 25(2015), 5, Seite 277-294 (DE-627)131011243 (DE-600)1088921-8 (DE-576)033025673 0924-9265 nnns volume:25 year:2015 number:5 pages:277-294 http://dx.doi.org/10.1515/dma-2015-0027 Volltext http://www.degruyter.com/doi/10.1515/dma-2015-0027 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2088 GBV_ILN_4277 31.00 AVZ AR 25 2015 5 277-294 |
| allfieldsSound |
10.1515/dma-2015-0027 doi PQ20160617 (DE-627)OLC1959007432 (DE-599)GBVOLC1959007432 (PRQ)walterdegruyter_journals_10_1515_dma_2015_00272552770 (KEY)0205755720150000025000500277onregularhypergraphswithhighgirthandhighchromaticn DE-627 ger DE-627 rakwb eng 510 DNB 31.00 bkl Alina E. Khuzieva verfasserin aut On regular hypergraphs with high girth and high chromatic number 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier 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. random recolouring method hypergraph girth of a hypergraph sparse hypergraphs colouring of hypergraphs Dmitriy A. Shabanov oth Enthalten in Discrete mathematics and applications Berlin : de Gruyter, 1991 25(2015), 5, Seite 277-294 (DE-627)131011243 (DE-600)1088921-8 (DE-576)033025673 0924-9265 nnns volume:25 year:2015 number:5 pages:277-294 http://dx.doi.org/10.1515/dma-2015-0027 Volltext http://www.degruyter.com/doi/10.1515/dma-2015-0027 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2088 GBV_ILN_4277 31.00 AVZ AR 25 2015 5 277-294 |
| language |
English |
| source |
Enthalten in Discrete mathematics and applications 25(2015), 5, Seite 277-294 volume:25 year:2015 number:5 pages:277-294 |
| sourceStr |
Enthalten in Discrete mathematics and applications 25(2015), 5, Seite 277-294 volume:25 year:2015 number:5 pages:277-294 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
random recolouring method hypergraph girth of a hypergraph sparse hypergraphs colouring of hypergraphs |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Discrete mathematics and applications |
| authorswithroles_txt_mv |
Alina E. Khuzieva @@aut@@ Dmitriy A. Shabanov @@oth@@ |
| publishDateDaySort_date |
2015-01-01T00:00:00Z |
| hierarchy_top_id |
131011243 |
| dewey-sort |
3510 |
| id |
OLC1959007432 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1959007432</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220214200312.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/dma-2015-0027</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1959007432</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1959007432</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)walterdegruyter_journals_10_1515_dma_2015_00272552770</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0205755720150000025000500277onregularhypergraphswithhighgirthandhighchromaticn</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Alina E. Khuzieva</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On regular hypergraphs with high girth and high chromatic number</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">random recolouring method</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">hypergraph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">girth of a hypergraph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">sparse hypergraphs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">colouring of hypergraphs</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Dmitriy A. Shabanov</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Discrete mathematics and applications</subfield><subfield code="d">Berlin : ˜deœ Gruyter, 1991</subfield><subfield code="g">25(2015), 5, Seite 277-294</subfield><subfield code="w">(DE-627)131011243</subfield><subfield code="w">(DE-600)1088921-8</subfield><subfield code="w">(DE-576)033025673</subfield><subfield code="x">0924-9265</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:5</subfield><subfield code="g">pages:277-294</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1515/dma-2015-0027</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.degruyter.com/doi/10.1515/dma-2015-0027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2015</subfield><subfield code="e">5</subfield><subfield code="h">277-294</subfield></datafield></record></collection>
|
| author |
Alina E. Khuzieva |
| spellingShingle |
Alina E. Khuzieva ddc 510 bkl 31.00 misc random recolouring method misc hypergraph misc girth of a hypergraph misc sparse hypergraphs misc colouring of hypergraphs On regular hypergraphs with high girth and high chromatic number |
| authorStr |
Alina E. Khuzieva |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)131011243 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0924-9265 |
| topic_title |
510 DNB 31.00 bkl On regular hypergraphs with high girth and high chromatic number random recolouring method hypergraph girth of a hypergraph sparse hypergraphs colouring of hypergraphs |
| topic |
ddc 510 bkl 31.00 misc random recolouring method misc hypergraph misc girth of a hypergraph misc sparse hypergraphs misc colouring of hypergraphs |
| topic_unstemmed |
ddc 510 bkl 31.00 misc random recolouring method misc hypergraph misc girth of a hypergraph misc sparse hypergraphs misc colouring of hypergraphs |
| topic_browse |
ddc 510 bkl 31.00 misc random recolouring method misc hypergraph misc girth of a hypergraph misc sparse hypergraphs misc colouring of hypergraphs |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
d a s das |
| hierarchy_parent_title |
Discrete mathematics and applications |
| hierarchy_parent_id |
131011243 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Discrete mathematics and applications |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)131011243 (DE-600)1088921-8 (DE-576)033025673 |
| title |
On regular hypergraphs with high girth and high chromatic number |
| ctrlnum |
(DE-627)OLC1959007432 (DE-599)GBVOLC1959007432 (PRQ)walterdegruyter_journals_10_1515_dma_2015_00272552770 (KEY)0205755720150000025000500277onregularhypergraphswithhighgirthandhighchromaticn |
| title_full |
On regular hypergraphs with high girth and high chromatic number |
| author_sort |
Alina E. Khuzieva |
| journal |
Discrete mathematics and applications |
| journalStr |
Discrete mathematics and applications |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
txt |
| container_start_page |
277 |
| author_browse |
Alina E. Khuzieva |
| container_volume |
25 |
| class |
510 DNB 31.00 bkl |
| format_se |
Aufsätze |
| author-letter |
Alina E. Khuzieva |
| doi_str_mv |
10.1515/dma-2015-0027 |
| dewey-full |
510 |
| title_sort |
on regular hypergraphs with high girth and high chromatic number |
| title_auth |
On regular hypergraphs with high girth and high chromatic number |
| 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. |
| abstractGer |
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. |
| abstract_unstemmed |
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. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2088 GBV_ILN_4277 |
| container_issue |
5 |
| title_short |
On regular hypergraphs with high girth and high chromatic number |
| url |
http://dx.doi.org/10.1515/dma-2015-0027 http://www.degruyter.com/doi/10.1515/dma-2015-0027 |
| remote_bool |
false |
| author2 |
Dmitriy A. Shabanov |
| author2Str |
Dmitriy A. Shabanov |
| ppnlink |
131011243 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth |
| doi_str |
10.1515/dma-2015-0027 |
| up_date |
2024-07-03T15:27:58.072Z |
| _version_ |
1803572192817971200 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1959007432</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220214200312.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/dma-2015-0027</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1959007432</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1959007432</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)walterdegruyter_journals_10_1515_dma_2015_00272552770</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0205755720150000025000500277onregularhypergraphswithhighgirthandhighchromaticn</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Alina E. Khuzieva</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On regular hypergraphs with high girth and high chromatic number</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">random recolouring method</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">hypergraph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">girth of a hypergraph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">sparse hypergraphs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">colouring of hypergraphs</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Dmitriy A. Shabanov</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Discrete mathematics and applications</subfield><subfield code="d">Berlin : ˜deœ Gruyter, 1991</subfield><subfield code="g">25(2015), 5, Seite 277-294</subfield><subfield code="w">(DE-627)131011243</subfield><subfield code="w">(DE-600)1088921-8</subfield><subfield code="w">(DE-576)033025673</subfield><subfield code="x">0924-9265</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:5</subfield><subfield code="g">pages:277-294</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1515/dma-2015-0027</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.degruyter.com/doi/10.1515/dma-2015-0027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2015</subfield><subfield code="e">5</subfield><subfield code="h">277-294</subfield></datafield></record></collection>
|
| score |
7.400031 |