Connector families of graphs

DOI10.1007/s00373-013-1347-3zbMath1306.05124OpenAlexW1981646468MaRDI QIDQ489306

János Körner, Emanuela Fachini, Gérard D. Cohen

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: http://jointmathematicsmeetings.org/amsmtgs/2141_abstracts/1086-05-1043.pdf

zbMATH Keywords

information theoryconnected graphgraph capacitypairwise union

Mathematics Subject Classification ID

Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Structured Codes of Graphs ⋮ Triangle-different Hamiltonian paths ⋮ On $k$-Neighbor Separated Permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Capacities: From information theory to extremal set theory
• On the capacity of Boolean graph formulæ
• Sperner capacities
• Triangle-intersecting families of graphs
• Families of Graph-different Hamilton Paths
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems on Structures
• Permutation Capacities of Families of Oriented Infinite Paths
• Pairwise colliding permutations and the capacity of infinite graphs
• Information Theory

This page was built for publication: Connector families of graphs