The uniformity space of hypergraphs and its applications

DOI10.1016/S0012-365X(98)00344-6MaRDI QIDQ1301700zbMATH OpenFDO

Authors Yair Caro, Raphael Yuster

Publication date 13 March 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypergraphlinear spaceRamsey numberszero-sum

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Generalized Ramsey theory (05C55) Hypergraphs (05C65)

Recommendations

• A linear upper bound in zero-sum Ramsey theory
• ON ZERO SUM RAMSEY NUMBERS—COMPLETE GRAPHS
• Binomial coefficients and zero-sum Ramsey numbers

Cites work

• scientific article; zbMATH DE number 3873377 (Why is no real title available?)
• scientific article; zbMATH DE number 4137812 (Why is no real title available?)
• scientific article; zbMATH DE number 3910426 (Why is no real title available?)
• scientific article; zbMATH DE number 4063149 (Why is no real title available?)
• scientific article; zbMATH DE number 1185608 (Why is no real title available?)
• scientific article; zbMATH DE number 3614795 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1286510 (Why is no real title available?)
• scientific article; zbMATH DE number 863500 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• A characterization of Zm-well-covered graphs of girth 6 or more
• A characterization of well covered graphs of girth 5 or greater
• A complete characterization of the zero-sum (mod 2) Ramsey numbers
• A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
• Generalizations of magic graphs
• Graph theory
• Local Structure When All Maximal Independent Sets Have Equal Weight
• Magic graphs, a characterization
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Recognizing Greedy Structures
• Some covering concepts in graphs
• The incidence matrix and labellings of a graph
• WELL-COVERED GRAPHS: A SURVEY
• Zero-sum bipartite Ramsey numbers

Cited in

(12)

• The well-covered dimension of products of graphs
• Computing well-covered vector spaces of graphs using modular decomposition
• On shift stable hypergraphs
• On the existence of zero-sum perfect matchings of complete graphs
• On the VC-dimension of uniform hypergraphs
• Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs
• The well-covered dimension of random graphs
• The finite upper half space and related hypergraphs
• On zero-sum spanning trees and zero-sum connectivity
• On the irregularity of uniform hypergraphs
• Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)
• On the irregularity of uniform hypergraphs

This page was built for publication: The uniformity space of hypergraphs and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301700)