Counting results for sparse pseudorandom hypergraphs. I. (Q2400983): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(9 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2017.04.008 / rank
Normal rank
 
Property / author
 
Property / author: Mathias Schacht / rank
Normal rank
 
Property / author
 
Property / author: Anusch Taraz / rank
Normal rank
 
Property / author
 
Property / author: Mathias Schacht / rank
 
Normal rank
Property / author
 
Property / author: Anusch Taraz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4207003154 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q102054515 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1602.08782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐random graphs with given degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal results in sparse pseudorandom graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relative Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3866151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing hamilton cycles in random and pseudo-random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing tight Hamilton cycles in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting results for sparse pseudorandom hypergraphs. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding graphs with bounded degree in sparse pseudorandom graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Edge Distribution of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universality of graphs with uniformly distributed edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3825110 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ejc/KohayakawaMST17 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2017.04.008 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:22, 18 December 2024

scientific article
Language Label Description Also known as
English
Counting results for sparse pseudorandom hypergraphs. I.
scientific article

    Statements

    Identifiers