scientific article; zbMATH DE number 3238444

zbMATH Open0147.42804MaRDI QIDQ5525916FDOQ5525916

Authors Gyula O. H. Katona, Endre Szemerédi

Publication date 1967

zbMATH Keywords

coveringdirected graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(26)

• On the Decomposition of Graphs
• Biclique cover and local clique cover of graphs
• A problem on algebraic graph theory
• Search when the lie depends on the target
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• On Four Problems in Graph Theory
• Upper and lower bounds for graph-diameter problems with application to Record allocation
• Inequalities for two set systems with prescribed intersections
• Bipartite Hansel results for hypergraphs
• Matchings and covers in hypergraphs
• Biclique covers and partitions
• Can visibility graphs be represented compactly?
• scientific article; zbMATH DE number 5881230 (Why is no real title available?)
• On the extremal combinatorics of the Hamming space
• Erdős-Pyber theorem for hypergraphs and secret sharing
• Separating systems and oriented graphs of diameter two
• Fault tolerant networks of specified diameter
• On separating systems
• On coloring parameters of triangle-free planar \((n, m)\)-graphs
• Rainbow saturation and graph capacities
• scientific article; zbMATH DE number 15129 (Why is no real title available?)
• Graphs in which each m-tuple of vertices is adjacent to the same number n of other vertices
• Hypergraph coverings and local colorings
• Distances in orientations of graphs
• scientific article; zbMATH DE number 519999 (Why is no real title available?)
• Local \(k\)-colorings of graphs and hypergraphs

This page was built for publication:

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