Difference-isomorphic graph families

DOI10.1016/J.JCTB.2026.06.001MaRDI QIDQ7306920zbMATH OpenFDO

Authors Lior Gishboliner, Zhihan Jin, Benny Sudakov

Publication date 31 July 2026

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2026.06.001

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Extremal set theory (05D05)

Cites work

• \(K_4\)-intersecting families of graphs
• A note on Hamiltonian-intersecting families of graphs
• Connectivity graph-codes
• Extremal problems for finite sets
• Graph-codes
• Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems on Structures
• Intersection theorems with geometric consequences
• On t-designs
• Phase transitions of structured codes of graphs
• Some intersection theorems for ordered sets and graphs
• Structured Codes of Graphs
• Triangle-intersecting families of graphs

This page was built for publication: Difference-isomorphic graph families

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