Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492845
DOI10.1007/11549345zbMATH Open1156.05330OpenAlexW2494705596MaRDI QIDQ5492845
Vojtěch Rödl, Andrzej Ruciński, Endre Szemerédi
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Related Items (13)
Generalisations of hypomorphisms and reconstruction of hypergraphs ⋮ A broken-circuits-theorem for hypergraphs ⋮ Applications of the Harary-Sachs theorem for hypergraphs ⋮ Duplication of directed graphs and exponential blow up of proofs ⋮ Generating functions of some families of directed uniform hypergraphs ⋮ Dichotomy theorems for countably infinite dimensional analytic hypergraphs ⋮ Title not available (Why is that?) ⋮ The \(\alpha\)-normal labeling for generalized directed uniform hypergraphs ⋮ Fine-Wilf graphs and the generalized Fine-Wilf theorem ⋮ Hall's theorem for hypergraphs ⋮ Title not available (Why is that?) ⋮ A note on maximal common subgraphs of the Dirac's family of graphs ⋮ A hypergraph version of the Gallai-Edmonds Theorem
This page was built for publication: Mathematical Foundations of Computer Science 2005
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492845)
