On Sets of Monochromatic Objects in Bicolored Point Sets
Fuente:
arXiv
Guardado en:
| Autores principales: | Bhore, Sujoy, Swanepoel, Konrad |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Coloring Grids Avoiding Bicolored Paths
por: Keskinkilic, Derman, et al.
Publicado: (2023)
por: Keskinkilic, Derman, et al.
Publicado: (2023)
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
por: Dumitrescu, Adrian, et al.
Publicado: (2024)
por: Dumitrescu, Adrian, et al.
Publicado: (2024)
Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
por: Concha-Vega, Pablo
Publicado: (2026)
por: Concha-Vega, Pablo
Publicado: (2026)
Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
por: Gutin, Gregory, et al.
Publicado: (2025)
por: Gutin, Gregory, et al.
Publicado: (2025)
Connected Dominating Sets in Triangulations
por: Bose, Prosenjit, et al.
Publicado: (2023)
por: Bose, Prosenjit, et al.
Publicado: (2023)
Maximal Independent Sets in Planar Triangulations
por: Francis, P., et al.
Publicado: (2024)
por: Francis, P., et al.
Publicado: (2024)
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
por: Jäger, Gerold, et al.
Publicado: (2019)
por: Jäger, Gerold, et al.
Publicado: (2019)
Face-hitting Dominating Sets in Planar Graphs
por: Francis, P., et al.
Publicado: (2024)
por: Francis, P., et al.
Publicado: (2024)
On the Number of Almost Empty Monochromatic Triangles
por: Bhattacharya, Bhaswar B., et al.
Publicado: (2026)
por: Bhattacharya, Bhaswar B., et al.
Publicado: (2026)
Regular matchstick graphs on the sphere
por: Swanepoel, Konrad J.
Publicado: (2025)
por: Swanepoel, Konrad J.
Publicado: (2025)
Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
por: Bhore, Sujoy, et al.
Publicado: (2026)
por: Bhore, Sujoy, et al.
Publicado: (2026)
Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
por: Spirkl, Sophie, et al.
Publicado: (2026)
por: Spirkl, Sophie, et al.
Publicado: (2026)
Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
por: Chen, Yeyuan
Publicado: (2024)
por: Chen, Yeyuan
Publicado: (2024)
Word-Representability of Split Graphs with Independent Set of Size 4
por: Roy, Suchanda, et al.
Publicado: (2025)
por: Roy, Suchanda, et al.
Publicado: (2025)
Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
por: Eze, L. C., et al.
Publicado: (2025)
por: Eze, L. C., et al.
Publicado: (2025)
Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
por: Hatzel, Meike, et al.
Publicado: (2026)
por: Hatzel, Meike, et al.
Publicado: (2026)
Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
por: Arras, Patrick, et al.
Publicado: (2024)
por: Arras, Patrick, et al.
Publicado: (2024)
Minimum Spanning Trees with Bounded Degrees of Vertices in a Specified Stable Set
por: Brause, Christoph, et al.
Publicado: (2022)
por: Brause, Christoph, et al.
Publicado: (2022)
A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs
por: Ihringer, Ferdinand
Publicado: (2024)
por: Ihringer, Ferdinand
Publicado: (2024)
Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
por: Choi, Mujin, et al.
Publicado: (2025)
por: Choi, Mujin, et al.
Publicado: (2025)
A Proof of Talagrand's Creating Large Sets Conjecture
por: Fang, Xuan, et al.
Publicado: (2025)
por: Fang, Xuan, et al.
Publicado: (2025)
$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
por: la Tour, Max Dupré, et al.
Publicado: (2024)
por: la Tour, Max Dupré, et al.
Publicado: (2024)
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
por: Gamarnik, David, et al.
Publicado: (2023)
por: Gamarnik, David, et al.
Publicado: (2023)
Stable Approximation Algorithms for Dominating Set and Independent Set
por: de Berg, Mark, et al.
Publicado: (2024)
por: de Berg, Mark, et al.
Publicado: (2024)
Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
por: Majewski, Konrad, et al.
Publicado: (2022)
por: Majewski, Konrad, et al.
Publicado: (2022)
Transitive Sets of Mutually Orthogonal Latin Squares
por: Keita, Amadou, et al.
Publicado: (2026)
por: Keita, Amadou, et al.
Publicado: (2026)
Free Sets in Planar Graphs: History and Applications
por: Dujmović, Vida, et al.
Publicado: (2024)
por: Dujmović, Vida, et al.
Publicado: (2024)
Witness Set in Monotone Polygons: Exact and Approximate
por: Das, Udvas, et al.
Publicado: (2025)
por: Das, Udvas, et al.
Publicado: (2025)
Temporal Reachability Dominating Sets: contagion in temporal graphs
por: Kutner, David C., et al.
Publicado: (2023)
por: Kutner, David C., et al.
Publicado: (2023)
Larger Nearly Orthogonal Sets over Finite Fields
por: Haviv, Ishay, et al.
Publicado: (2024)
por: Haviv, Ishay, et al.
Publicado: (2024)
Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
por: Au, Yu Hin, et al.
Publicado: (2023)
por: Au, Yu Hin, et al.
Publicado: (2023)
Hypergraph Representation via Axis-Aligned Point-Subspace Cover
por: Firman, Oksana, et al.
Publicado: (2021)
por: Firman, Oksana, et al.
Publicado: (2021)
Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2026)
por: Srinivasan, Eshwar, et al.
Publicado: (2026)
Fault-tolerant Locating-Dominating Sets on the Infinite King Grid
por: Jean, Devin, et al.
Publicado: (2022)
por: Jean, Devin, et al.
Publicado: (2022)
Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting
por: Avila, Tatiana Rocha, et al.
Publicado: (2026)
por: Avila, Tatiana Rocha, et al.
Publicado: (2026)
Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
por: Shook, James M., et al.
Publicado: (2025)
por: Shook, James M., et al.
Publicado: (2025)
Nearly Orthogonal Sets over Finite Fields
por: Chawin, Dror, et al.
Publicado: (2024)
por: Chawin, Dror, et al.
Publicado: (2024)
How to Learn a Star: Binary Classification with Starshaped Polyhedral Sets
por: Brandenburg, Marie-Charlotte, et al.
Publicado: (2025)
por: Brandenburg, Marie-Charlotte, et al.
Publicado: (2025)
Symbolic Sets for Proving Bounds on Rado Numbers
por: Ahmed, Tanbir, et al.
Publicado: (2025)
por: Ahmed, Tanbir, et al.
Publicado: (2025)
Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools
por: Du, Alina, et al.
Publicado: (2026)
por: Du, Alina, et al.
Publicado: (2026)
Ejemplares similares
-
Coloring Grids Avoiding Bicolored Paths
por: Keskinkilic, Derman, et al.
Publicado: (2023) -
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
por: Dumitrescu, Adrian, et al.
Publicado: (2024) -
Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
por: Concha-Vega, Pablo
Publicado: (2026) -
Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
por: Gutin, Gregory, et al.
Publicado: (2025) -
Connected Dominating Sets in Triangulations
por: Bose, Prosenjit, et al.
Publicado: (2023)