Hypergraph extensions of the Erdős-Gallai Theorem

We extend the Erdős-Gallai Theorem for Berge paths in r-uniform hypergraphs. We also find the extremal hypergraphs avoiding t-tight paths of a given length and consider this extremal problem for other definitions of paths in hypergraphs.

Saved in:
Bibliographic Details
Published inEuropean journal of combinatorics Vol. 58; no. C; pp. 238 - 246
Main Authors Győri, Ervin, Katona, Gyula Y., Lemons, Nathan
Format Journal Article
LanguageEnglish
Published United Kingdom Elsevier Ltd 01.11.2016
Elsevier
Online AccessGet full text
ISSN0195-6698
1095-9971
DOI10.1016/j.ejc.2016.05.012

Cover

Abstract We extend the Erdős-Gallai Theorem for Berge paths in r-uniform hypergraphs. We also find the extremal hypergraphs avoiding t-tight paths of a given length and consider this extremal problem for other definitions of paths in hypergraphs.
AbstractList We extend the Erdős-Gallai Theorem for Berge paths in r-uniform hypergraphs. We also find the extremal hypergraphs avoiding t-tight paths of a given length and consider this extremal problem for other definitions of paths in hypergraphs.
Author Lemons, Nathan
Katona, Gyula Y.
Győri, Ervin
Author_xml – sequence: 1
  givenname: Ervin
  surname: Győri
  fullname: Győri, Ervin
  email: gyori.ervin@renyi.mta.hu
  organization: Rényi Institute, Hungarian Academy of Sciences, Central European University, Budapest, Hungary
– sequence: 2
  givenname: Gyula Y.
  surname: Katona
  fullname: Katona, Gyula Y.
  email: kiskat@cs.bme.hu
  organization: Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Hungary
– sequence: 3
  givenname: Nathan
  surname: Lemons
  fullname: Lemons, Nathan
  email: nlemons@lanl.gov
  organization: Los Alamos National Laboratory, United States
BackLink https://www.osti.gov/biblio/1363679$$D View this record in Osti.gov
BookMark eNp9kEFOwzAQRS1UJNrCAdhF7BPsGNu1WKGqFKRKbMracu0xcZTGlR0hegwOxb1wVFYsupq_mPdn_p-hSR96QOiW4Ipgwu_bClpT1VlWmFWY1BdoSrBkpZSCTNAUk6w5l4srNEupxZgQRukU1S_HA8SPqA9NAV8D9MmHPhXBFUMDxSran-9UrnXXaV9sGwgR9tfo0ukuwc3fnKP359V2-VJu3tavy6dNaSgXQ2kXTHOzACaEkLUh0jiujSYgakoXD9ZY4XBNWb0TgtmdxI46o6lk2nLquKFzdHfyDWnwKhk_gGlM6HswgyKU5ysyL5HTkokhpQhOHaLf63hUBKuxGdWq3Iwam1GYqdxMZsQ_JnvrIQcfovbdWfLxRELO_ekhjm9Bb8D6OH5lgz9D_wKHxH-S
CitedBy_id crossref_primary_10_1016_j_ejc_2018_11_001
crossref_primary_10_1007_s00373_024_02802_8
crossref_primary_10_1016_j_amc_2017_12_036
crossref_primary_10_1137_19M1243658
crossref_primary_10_1016_j_ejc_2021_103435
crossref_primary_10_1016_j_ejc_2021_103353
crossref_primary_10_1017_S0963548319000415
crossref_primary_10_1137_18M117741X
crossref_primary_10_3390_math10132353
crossref_primary_10_1016_j_ejc_2019_103001
crossref_primary_10_1016_j_ejc_2023_103692
crossref_primary_10_1137_18M1225227
crossref_primary_10_1016_j_disc_2020_111972
crossref_primary_10_1016_j_disc_2022_112901
crossref_primary_10_1016_j_ejc_2017_10_006
crossref_primary_10_1016_j_ejc_2020_103082
crossref_primary_10_1007_s11401_021_0272_7
crossref_primary_10_1016_j_disc_2018_06_006
crossref_primary_10_1016_j_disc_2019_01_031
crossref_primary_10_1016_j_jctb_2024_11_003
crossref_primary_10_1016_j_ejc_2024_103930
crossref_primary_10_1007_s00493_024_00096_1
crossref_primary_10_1007_s00373_018_1900_1
crossref_primary_10_1007_s00373_021_02419_1
crossref_primary_10_1016_j_ejc_2019_02_002
crossref_primary_10_1016_j_disc_2024_113877
crossref_primary_10_1016_j_jctb_2018_12_001
crossref_primary_10_4274_meandros_galenos_2021_09582
crossref_primary_10_1016_j_ejc_2022_103506
crossref_primary_10_1016_j_disc_2019_02_003
crossref_primary_10_1016_j_jctb_2019_01_001
crossref_primary_10_1137_16M1066191
crossref_primary_10_1016_j_dam_2019_07_011
crossref_primary_10_1016_j_disc_2022_113286
crossref_primary_10_1016_j_disc_2024_114232
crossref_primary_10_1360_SSM_2023_0201
crossref_primary_10_1016_j_disc_2024_114293
crossref_primary_10_1137_19M1244950
crossref_primary_10_1016_j_jctb_2020_04_007
crossref_primary_10_1016_j_disc_2023_113828
crossref_primary_10_1109_TIT_2023_3244939
crossref_primary_10_1016_j_disc_2020_111949
crossref_primary_10_1016_j_jcta_2017_01_003
crossref_primary_10_1016_j_ejc_2024_103969
crossref_primary_10_1137_20M1345712
Cites_doi 10.1016/j.ejc.2006.07.001
10.1016/j.endm.2011.09.061
10.1016/S0195-6698(85)80023-8
10.1002/jgt.20329
10.1002/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O
10.1016/0097-3165(87)90016-1
10.1016/j.ejc.2011.10.003
10.1016/j.endm.2010.05.083
10.1016/j.jcta.2010.02.010
10.1016/j.disc.2007.07.074
10.1007/BF02024498
ContentType Journal Article
Copyright 2016 Elsevier Ltd
Copyright_xml – notice: 2016 Elsevier Ltd
DBID AAYXX
CITATION
OTOTI
DOI 10.1016/j.ejc.2016.05.012
DatabaseName CrossRef
OSTI.GOV
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1095-9971
EndPage 246
ExternalDocumentID 1363679
10_1016_j_ejc_2016_05_012
S0195669816300403
GroupedDBID --K
--M
-ET
-~X
.~1
0R~
1B1
1RT
1~.
1~5
29G
4.4
457
4G.
5GY
5VS
6I.
6OB
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AASFE
AAXUO
ABAOU
ABFNM
ABJNI
ABMAC
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ADBBV
ADEZE
ADFGL
ADIYS
ADMUD
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CAG
COF
CS3
DM4
DU5
EBS
EFBJH
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HVGLF
HZ~
H~9
IHE
IXB
J1W
KOM
LG5
M25
M41
MCRUF
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSW
SSZ
T5K
WUQ
XPP
ZMT
ZU3
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AFXIZ
AGCQF
AGQPQ
AGRNS
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
BNPGV
CITATION
SSH
AALMO
ABPIF
ABPTK
EFJIC
OTOTI
ID FETCH-LOGICAL-c367t-d85a6c8e577792c19cf6aca1e723384dcd7f02352b775db90f3fca395ad63f6c3
IEDL.DBID AIKHN
ISSN 0195-6698
IngestDate Fri May 19 00:43:43 EDT 2023
Tue Jul 01 01:37:03 EDT 2025
Thu Apr 24 22:59:30 EDT 2025
Fri Feb 23 02:17:13 EST 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue C
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c367t-d85a6c8e577792c19cf6aca1e723384dcd7f02352b775db90f3fca395ad63f6c3
Notes USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
AC52-06NA25396
OpenAccessLink https://www.osti.gov/biblio/1363679
PageCount 9
ParticipantIDs osti_scitechconnect_1363679
crossref_primary_10_1016_j_ejc_2016_05_012
crossref_citationtrail_10_1016_j_ejc_2016_05_012
elsevier_sciencedirect_doi_10_1016_j_ejc_2016_05_012
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate November 2016
2016-11-00
2016-11-01
PublicationDateYYYYMMDD 2016-11-01
PublicationDate_xml – month: 11
  year: 2016
  text: November 2016
PublicationDecade 2010
PublicationPlace United Kingdom
PublicationPlace_xml – name: United Kingdom
PublicationTitle European journal of combinatorics
PublicationYear 2016
Publisher Elsevier Ltd
Elsevier
Publisher_xml – name: Elsevier Ltd
– name: Elsevier
References Mubayi, Verstraëte (br000060) 2007; 28
Erdős, Gallai (br000015) 1959; 10
Rödl (br000070) 1985; 6
Glebov, Person, Weps (br000040) 2012; 33
Tuza (br000075) 2006; 61
Gerbner, Palmer (br000035)
Dorbec, Gravier, Sárközy (br000010) 2008; 59
Győri, Katona, Lemons (br000045) 2006; 36
Kühn, Mycroft, Osthus (br000055) 2010; 117
Patkós (br000065) 2012; 2
Frankl, Füredi (br000020) 1987; 45
Frankl, Katona (br000025) 2008; 308
Katona, Kierstead (br000050) 1999; 30
Füredi (br000030) 2011; 38
P. Allen, J. Böttcher, O. Cooley, R. Mycroft, Tight cycles and regular slices in dense hypergraphs, manuscript.
Katona (10.1016/j.ejc.2016.05.012_br000050) 1999; 30
Győri (10.1016/j.ejc.2016.05.012_br000045) 2006; 36
10.1016/j.ejc.2016.05.012_br000005
Füredi (10.1016/j.ejc.2016.05.012_br000030) 2011; 38
Glebov (10.1016/j.ejc.2016.05.012_br000040) 2012; 33
Kühn (10.1016/j.ejc.2016.05.012_br000055) 2010; 117
Rödl (10.1016/j.ejc.2016.05.012_br000070) 1985; 6
Dorbec (10.1016/j.ejc.2016.05.012_br000010) 2008; 59
Frankl (10.1016/j.ejc.2016.05.012_br000025) 2008; 308
Erdős (10.1016/j.ejc.2016.05.012_br000015) 1959; 10
Tuza (10.1016/j.ejc.2016.05.012_br000075) 2006; 61
Gerbner (10.1016/j.ejc.2016.05.012_br000035)
Patkós (10.1016/j.ejc.2016.05.012_br000065) 2012; 2
Mubayi (10.1016/j.ejc.2016.05.012_br000060) 2007; 28
Frankl (10.1016/j.ejc.2016.05.012_br000020) 1987; 45
References_xml – volume: 59
  start-page: 34
  year: 2008
  end-page: 44
  ident: br000010
  article-title: Monochromatic Hamiltonian
  publication-title: J. Graph Theory
– volume: 10
  start-page: 337
  year: 1959
  end-page: 356
  ident: br000015
  article-title: On maximal paths and circuits of graphs
  publication-title: Acta Math. Acad. Sci. Hungar.
– volume: 2
  start-page: 47
  year: 2012
  end-page: 55
  ident: br000065
  article-title: A note on traces of set families
  publication-title: Mosc. J. Combin. Number Theory
– volume: 117
  start-page: 910
  year: 2010
  end-page: 927
  ident: br000055
  article-title: Hamilton l-cycles in uniform hypergraphs
  publication-title: J. Combin. Theory Ser. A
– volume: 61
  start-page: 173
  year: 2006
  end-page: 180
  ident: br000075
  article-title: Steiner systems and large non-Hamiltonian hypergraphs
  publication-title: Matematiche (Catania)
– volume: 33
  start-page: 544
  year: 2012
  end-page: 555
  ident: br000040
  article-title: On extremal hypergraphs for Hamiltonian cycles
  publication-title: European J. Combin.
– ident: br000035
  article-title: Extremal results for Berge-hypergraphs
– reference: P. Allen, J. Böttcher, O. Cooley, R. Mycroft, Tight cycles and regular slices in dense hypergraphs, manuscript.
– volume: 308
  start-page: 1415
  year: 2008
  end-page: 1424
  ident: br000025
  article-title: Extremal
  publication-title: Discrete Math.
– volume: 6
  start-page: 69
  year: 1985
  end-page: 78
  ident: br000070
  article-title: On a packing and covering problem
  publication-title: European J. Combin.
– volume: 30
  start-page: 205
  year: 1999
  end-page: 212
  ident: br000050
  article-title: Hamiltonian chains in hypergraphs
  publication-title: J. Graph Theory
– volume: 36
  start-page: 655
  year: 2006
  end-page: 662
  ident: br000045
  article-title: Hypergraph extensions of the Erdős-Gallai theorem
  publication-title: Electron. Notes Discrete Math.
– volume: 38
  start-page: 377
  year: 2011
  end-page: 382
  ident: br000030
  article-title: Linear paths and trees in uniform hypergraphs
  publication-title: Electron. Notes Discrete Math.
– volume: 45
  start-page: 226
  year: 1987
  end-page: 262
  ident: br000020
  article-title: Exact solution of some Turán-type problems
  publication-title: J. Combin. Theory Ser. A
– volume: 28
  start-page: 1681
  year: 2007
  end-page: 1693
  ident: br000060
  article-title: Minimal paths and cycles in set systems
  publication-title: European J. Combin.
– volume: 28
  start-page: 1681
  year: 2007
  ident: 10.1016/j.ejc.2016.05.012_br000060
  article-title: Minimal paths and cycles in set systems
  publication-title: European J. Combin.
  doi: 10.1016/j.ejc.2006.07.001
– ident: 10.1016/j.ejc.2016.05.012_br000005
– volume: 38
  start-page: 377
  year: 2011
  ident: 10.1016/j.ejc.2016.05.012_br000030
  article-title: Linear paths and trees in uniform hypergraphs
  publication-title: Electron. Notes Discrete Math.
  doi: 10.1016/j.endm.2011.09.061
– volume: 61
  start-page: 173
  year: 2006
  ident: 10.1016/j.ejc.2016.05.012_br000075
  article-title: Steiner systems and large non-Hamiltonian hypergraphs
  publication-title: Matematiche (Catania)
– volume: 6
  start-page: 69
  year: 1985
  ident: 10.1016/j.ejc.2016.05.012_br000070
  article-title: On a packing and covering problem
  publication-title: European J. Combin.
  doi: 10.1016/S0195-6698(85)80023-8
– volume: 59
  start-page: 34
  issue: 1
  year: 2008
  ident: 10.1016/j.ejc.2016.05.012_br000010
  article-title: Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.20329
– ident: 10.1016/j.ejc.2016.05.012_br000035
– volume: 30
  start-page: 205
  issue: 3
  year: 1999
  ident: 10.1016/j.ejc.2016.05.012_br000050
  article-title: Hamiltonian chains in hypergraphs
  publication-title: J. Graph Theory
  doi: 10.1002/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O
– volume: 45
  start-page: 226
  issue: 2
  year: 1987
  ident: 10.1016/j.ejc.2016.05.012_br000020
  article-title: Exact solution of some Turán-type problems
  publication-title: J. Combin. Theory Ser. A
  doi: 10.1016/0097-3165(87)90016-1
– volume: 2
  start-page: 47
  issue: 1
  year: 2012
  ident: 10.1016/j.ejc.2016.05.012_br000065
  article-title: A note on traces of set families
  publication-title: Mosc. J. Combin. Number Theory
– volume: 33
  start-page: 544
  issue: 4
  year: 2012
  ident: 10.1016/j.ejc.2016.05.012_br000040
  article-title: On extremal hypergraphs for Hamiltonian cycles
  publication-title: European J. Combin.
  doi: 10.1016/j.ejc.2011.10.003
– volume: 36
  start-page: 655
  year: 2006
  ident: 10.1016/j.ejc.2016.05.012_br000045
  article-title: Hypergraph extensions of the Erdős-Gallai theorem
  publication-title: Electron. Notes Discrete Math.
  doi: 10.1016/j.endm.2010.05.083
– volume: 117
  start-page: 910
  issue: 7
  year: 2010
  ident: 10.1016/j.ejc.2016.05.012_br000055
  article-title: Hamilton l-cycles in uniform hypergraphs
  publication-title: J. Combin. Theory Ser. A
  doi: 10.1016/j.jcta.2010.02.010
– volume: 308
  start-page: 1415
  issue: 8
  year: 2008
  ident: 10.1016/j.ejc.2016.05.012_br000025
  article-title: Extremal k-edge Hamiltonian hypergraphs
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2007.07.074
– volume: 10
  start-page: 337
  year: 1959
  ident: 10.1016/j.ejc.2016.05.012_br000015
  article-title: On maximal paths and circuits of graphs
  publication-title: Acta Math. Acad. Sci. Hungar.
  doi: 10.1007/BF02024498
SSID ssj0011533
Score 2.396779
Snippet We extend the Erdős-Gallai Theorem for Berge paths in r-uniform hypergraphs. We also find the extremal hypergraphs avoiding t-tight paths of a given length and...
SourceID osti
crossref
elsevier
SourceType Open Access Repository
Enrichment Source
Index Database
Publisher
StartPage 238
Title Hypergraph extensions of the Erdős-Gallai Theorem
URI https://dx.doi.org/10.1016/j.ejc.2016.05.012
https://www.osti.gov/biblio/1363679
Volume 58
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LTwIxEG5wuejB-IyIkj14MlnZV9vtEQkIEjmoRG6bPhOIAgG8-h_8Uf4vO_sgepCDp802nc1m2s6rM98gdOUrg30juEdFIDyr8YUnmDJewhkxsQYMtAztc0h6o_h-jMcV1C5rYSCtspD9uUzPpHUx0iy42VxMJs2nrNSNsCTIUKMA8bMaRoxgB1Vb_UFvuLlMAJOmbEsIBOXlZpbmpacAZBiQHL8z_Es9OXN74n5onu4B2i9MRreV_9UhqujZEdp72OCtro5R2LPu5DIDn3azsDbEwFbu3Lh2kttZqq_PlXcHMfOJm1Xj67cTNOp2nts9r-iG4MmI0LWnEsyJTDSmlLJQBkwawiUPNA2tmxkrqagB8JpQUIqVYL6JjOQRw1yRyBAZnSJnNp_pM-Rao8kII0M_SnSsYm59LkqNsK5FLEnCeQ35JRNSWUCFQ8eK17TMCZumlm8p8C31cWr5VkPXG5JFjpOxbXJccjb9tdiplePbyOqwCkACALcSMoEsTRDZ_UTZ-f8-Wke78JaXF14gZ71815fWzliLBtq5-QgaxW6C5-DxZWBH--PbbxGQ00A
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LTwIxEG4IHtSD8RkRH3vwZLJhn-32qARcFLgICbemzwSjQAB_iD_K_2Wnu0v0IAevuzObzdd2Hu3MV4RuA2XSwAjuExEK33p84QuqjJ9xik2igQPNsX0OcT5OnibppIbaVS8MlFWWtr-w6c5al09aJZqtxXTaenGtbphmoWONAsbPHRsNYCDQ700eNkcJENBUlxKCeHW06Yq89CvQGIa4YO-M_nJO9bldbz_8TvcQHZQBo3df_NMRqunZMdofbNhWVycoym0yuXTU057b1IYdsJU3N54V8jpL9fW58h9hx3zquV58_X6Kxt3OqJ375V0IvowxWfsqSzmWmU4JITSSIZUGc8lDTSKbZCZKKmKAuiYShKRK0MDERvKYplzh2GAZn6H6bD7T58izIBlhZBTEmU5Uwm3GRYgRNrFIJM44b6CgAoHJkigc7qt4Y1VF2CuzuDHAjQUps7g10N1GZVGwZGwTTipk2a-hZtaKb1NrwiiACtDbSqgDsjphbGcToRf_--gN2s1Hgz7r94bPTbQHb4pGw0tUXy8_9JWNONbi2s2ob2Ls0XE
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Hypergraph+extensions+of+the+Erd%C5%91s-Gallai+Theorem&rft.jtitle=European+journal+of+combinatorics&rft.au=Gy%C5%91ri%2C+Ervin&rft.au=Katona%2C+Gyula+Y.&rft.au=Lemons%2C+Nathan&rft.date=2016-11-01&rft.pub=Elsevier&rft.issn=0195-6698&rft.eissn=1095-9971&rft.volume=58&rft.issue=C&rft_id=info:doi/10.1016%2Fj.ejc.2016.05.012&rft.externalDocID=1363679
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0195-6698&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0195-6698&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0195-6698&client=summon