Pseudorandom hypergraph matchings
A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect matching which is ‘pseudorandom’, meaning that, for instance, the matching contains as many edges from a given set of edge...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
22 July 2020
|
| In: |
Combinatorics, probability & computing
Year: 2020, Volume: 29, Issue: 6, Pages: 868-885 |
| ISSN: | 1469-2163 |
| DOI: | 10.1017/S0963548320000280 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1017/S0963548320000280 Verlag, lizenzpflichtig, Volltext: https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/pseudorandom-hypergraph-matchings/AE0DE17C95900E7DD3F221E2C17FE203 
|
| Author Notes: | Stefan Ehard, Stefan Glock and Felix Joos |
MARC
| LEADER | 00000caa a2200000 c 4500 | ||
|---|---|---|---|
| 001 | 1750223988 | ||
| 003 | DE-627 | ||
| 005 | 20220819125103.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 210303s2020 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1017/S0963548320000280 |2 doi | |
| 035 | |a (DE-627)1750223988 | ||
| 035 | |a (DE-599)KXP1750223988 | ||
| 035 | |a (OCoLC)1341396930 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 084 | |a 27 |2 sdnb | ||
| 100 | 1 | |a Ehard, Stefan |e VerfasserIn |0 (DE-588)1226449379 |0 (DE-627)1747506230 |4 aut | |
| 245 | 1 | 0 | |a Pseudorandom hypergraph matchings |c Stefan Ehard, Stefan Glock and Felix Joos |
| 264 | 1 | |c 22 July 2020 | |
| 300 | |a 18 | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Gesehen am 01.06.2022 | ||
| 520 | |a A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect matching which is ‘pseudorandom’, meaning that, for instance, the matching contains as many edges from a given set of edges as predicted by a heuristic argument. | ||
| 650 | 4 | |a 05C15 | |
| 650 | 4 | |a 05C65 | |
| 650 | 4 | |a 05C70 | |
| 650 | 4 | |a 05D15 | |
| 650 | 4 | |a 05D40 | |
| 700 | 1 | |a Glock, Stefan |e VerfasserIn |0 (DE-588)1058404121 |0 (DE-627)796847827 |0 (DE-576)414583949 |4 aut | |
| 700 | 1 | |a Joos, Felix |d 1989- |e VerfasserIn |0 (DE-588)1075006171 |0 (DE-627)832846244 |0 (DE-576)442747438 |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Combinatorics, probability & computing |d Cambridge : Cambridge Univ. Press, 1992 |g 29(2020), 6, Seite 868-885 |h Online-Ressource |w (DE-627)271601256 |w (DE-600)1481145-5 |w (DE-576)07870927X |x 1469-2163 |7 nnas |a Pseudorandom hypergraph matchings |
| 773 | 1 | 8 | |g volume:29 |g year:2020 |g number:6 |g pages:868-885 |g extent:18 |a Pseudorandom hypergraph matchings |
| 856 | 4 | 0 | |u https://doi.org/10.1017/S0963548320000280 |x Verlag |x Resolving-System |z lizenzpflichtig |3 Volltext |
| 856 | 4 | 0 | |u https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/pseudorandom-hypergraph-matchings/AE0DE17C95900E7DD3F221E2C17FE203 |x Verlag |z lizenzpflichtig |3 Volltext |
| 951 | |a AR | ||
| 992 | |a 20210303 | ||
| 993 | |a Article | ||
| 994 | |a 2020 | ||
| 998 | |g 1075006171 |a Joos, Felix |m 1075006171:Joos, Felix |d 110000 |d 110300 |e 110000PJ1075006171 |e 110300PJ1075006171 |k 0/110000/ |k 1/110000/110300/ |p 3 |y j | ||
| 999 | |a KXP-PPN1750223988 |e 388075487X | ||
| BIB | |a Y | ||
| SER | |a journal | ||
| JSO | |a {"origin":[{"dateIssuedKey":"2020","dateIssuedDisp":"22 July 2020"}],"relHost":[{"title":[{"title":"Combinatorics, probability & computing","subtitle":"CPC","title_sort":"Combinatorics, probability & computing"}],"physDesc":[{"extent":"Online-Ressource"}],"id":{"zdb":["1481145-5"],"eki":["271601256"],"issn":["1469-2163"]},"origin":[{"dateIssuedDisp":"1992-","publisher":"Cambridge Univ. Press","publisherPlace":"Cambridge","dateIssuedKey":"1992"}],"recId":"271601256","disp":"Pseudorandom hypergraph matchingsCombinatorics, probability & computing","type":{"bibl":"periodical","media":"Online-Ressource"},"titleAlt":[{"title":"CPC"}],"language":["eng"],"part":{"volume":"29","year":"2020","issue":"6","extent":"18","pages":"868-885","text":"29(2020), 6, Seite 868-885"},"pubHistory":["1.1992 -"],"note":["Gesehen am 05.03.2018"]}],"physDesc":[{"extent":"18 S."}],"id":{"eki":["1750223988"],"doi":["10.1017/S0963548320000280"]},"title":[{"title":"Pseudorandom hypergraph matchings","title_sort":"Pseudorandom hypergraph matchings"}],"type":{"media":"Online-Ressource","bibl":"article-journal"},"note":["Gesehen am 01.06.2022"],"person":[{"display":"Ehard, Stefan","given":"Stefan","family":"Ehard","role":"aut"},{"display":"Glock, Stefan","given":"Stefan","family":"Glock","role":"aut"},{"display":"Joos, Felix","given":"Felix","role":"aut","family":"Joos"}],"recId":"1750223988","name":{"displayForm":["Stefan Ehard, Stefan Glock and Felix Joos"]},"language":["eng"]} | ||
| SRT | |a EHARDSTEFAPSEUDORAND2220 | ||