Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492845zbMATH OpenOpenAlexFDO

Authors Andrzej Ruciński, Vojtěch Rödl, 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

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65)

Recommendations

• Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
• Recent advances on Dirac-type problems for hypergraphs
• scientific article; zbMATH DE number 7448677
• The matching number and Hamiltonicity of graphs
• scientific article; zbMATH DE number 5763200

Cited in

(16)

• Duplication of directed graphs and exponential blow up of proofs
• Fine-Wilf graphs and the generalized Fine-Wilf theorem
• The matching number and Hamiltonicity of graphs
• scientific article; zbMATH DE number 5941304 (Why is no real title available?)
• Generalisations of hypomorphisms and reconstruction of hypergraphs
• Hall's theorem for hypergraphs
• A hypergraph version of the Gallai-Edmonds Theorem
• Recent advances on Dirac-type problems for hypergraphs
• scientific article; zbMATH DE number 4139789 (Why is no real title available?)
• Applications of the Harary-Sachs theorem for hypergraphs
• Generating functions of some families of directed uniform hypergraphs
• A note on maximal common subgraphs of the Dirac's family of graphs
• Dichotomy theorems for countably infinite dimensional analytic hypergraphs
• A broken-circuits-theorem for hypergraphs
• Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
• The \(\alpha\)-normal labeling for generalized directed uniform hypergraphs

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)