Incidence‐free sets and edge domination in incidence graphs
From MaRDI portal
Publication:6121301
DOI10.1002/jcd.21925arXiv2211.14339OpenAlexW4388991516MaRDI QIDQ6121301
Sam Spiro, Sam Adriaensen, Sam Mattheus
Publication date: 26 February 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.14339
Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite generalized quadrangles
- Classification of 2-transitive symmetric designs
- Chessboard graphs, related designs, and domination parameters
- Maximal arcs in Desarguesian planes of odd order do not exist
- Roman domination in graphs.
- The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\)
- Some families of semibiplanes
- Construction of maximal arcs and partial geometries
- Interlacing eigenvalues and graphs
- Nonincident points and blocks in designs
- Large incidence-free sets in geometries
- Domination number of incidence graphs of block designs
- Dense expanders and pseudo-random bipartite graphs
- An Unbiased Marriage Theorem
- Minimum Edge Dominating Sets
- Edge Dominating Sets in Graphs
- On Orthogonal Matrices
- Total Domination in Graphs
- Dominating sets in finite generalized quadrangles
- Strongly Regular Graphs
- On the independence number of graphs related to a polarity
- Symmetric Bush-type Hadamard matrices of order $4m^4$ exist for all odd $m$
- Dominating Sets in Projective Planes
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- Some maximal arcs in finite projective planes
- On a problem of K. Zarankiewicz
This page was built for publication: Incidence‐free sets and edge domination in incidence graphs
