Intersections of graphs
From MaRDI portal
Publication:3168657
DOI10.1002/JGT.20489zbMATH Open1294.05134OpenAlexW1984410432MaRDI QIDQ3168657FDOQ3168657
Authors: Béla Bollobás, Alex Scott 
Publication date: 19 April 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20489
Recommendations
Cites Work
- Title not available (Why is that?)
- Quasi-random graphs
- Title not available (Why is that?)
- Cutting a graph into two dissimilar halves
- Uniform edge distribution in hypergraphs is hereditary
- Quasi-Random Set Systems
- A local density condition for triangles
- On the edge distribution in triangle-free graphs
- Local Density in Graphs with Forbidden Subgraphs
Cited In (16)
- Joins and intersections
- Title not available (Why is that?)
- Intersection graphs of homothetic polygons
- Title not available (Why is that?)
- Intersection graphs of non-crossing paths
- Discrepancy of random graphs and hypergraphs
- Modular intersection graphs
- Intersections of random hypergraphs and tournaments
- How unproportional must a graph be?
- A generalization of line graphs: (X, Y)-intersection graphs
- On a problem of Eric Mendelsohn on edge-intersections of graphs
- Intersections of hypergraphs
- Intersections and circuits in sets of line segments
- Intersection graphs of rays and grounded segments
- Characterizing intersection classes of graphs
- On grid intersection graphs
This page was built for publication: Intersections of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3168657)
